![]() | A request that this article title be changed to
300-399 (numbers) is
under discussion. Please do not move this article until the discussion is closed. |
This article needs additional citations for
verification. (May 2016) |
| ||||
---|---|---|---|---|
Cardinal | three hundred | |||
Ordinal | 300th (three hundredth) | |||
Factorization | 22 × 3 × 52 | |||
Greek numeral | Τ´ | |||
Roman numeral | CCC | |||
Binary | 1001011002 | |||
Ternary | 1020103 | |||
Senary | 12206 | |||
Octal | 4548 | |||
Duodecimal | 21012 | |||
Hexadecimal | 12C16 | |||
Hebrew | ש | |||
Armenian | Յ | |||
Babylonian cuneiform | 𒐙 | |||
Egyptian hieroglyph | 𓍤 |
300 (three hundred) is the natural number following 299 and preceding 301.
The number 300 is a triangular number and the sum of a pair of twin primes (149 + 151), as well as the sum of ten consecutive primes (13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47). It is palindromic in 3 consecutive bases: 30010 = 6067 = 4548 = 3639, and also in base 13. Factorization is 22 × 3 × 52. 30064 + 1 is prime
309 = 3 × 103, Blum integer, number of primes <= 211. [1] As of April 2024 [update], it is the lowest number to not have an article in Wikipedia, [2] possibly making it interesting in the interesting number paradox.
312 = 23 × 3 × 13, idoneal number.
314 = 2 × 157. 314 is a nontotient, [3] smallest composite number in Somos-4 sequence. [4]
315 = 32 × 5 × 7 = rencontres number, highly composite odd number, having 12 divisors. [5]
316 = 22 × 79, a centered triangular number [6] and a centered heptagonal number. [7]
317 is a prime number, Eisenstein prime with no imaginary part, Chen prime, [8] one of the rare primes to be both right and left-truncatable, [9] and a strictly non-palindromic number.
317 is the exponent (and number of ones) in the fourth base-10 repunit prime. [10]
319 = 11 × 29. 319 is the sum of three consecutive primes (103 + 107 + 109), Smith number, [11] cannot be represented as the sum of fewer than 19 fourth powers, happy number in base 10 [12]
320 = 26 × 5 = (25) × (2 × 5). 320 is a Leyland number, [13] and maximum determinant of a 10 by 10 matrix of zeros and ones.
321 = 3 × 107, a Delannoy number [14]
322 = 2 × 7 × 23. 322 is a sphenic, [15] nontotient, untouchable, [16] and a Lucas number. [17]
323 = 17 × 19. 323 is the sum of nine consecutive primes (19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53), the sum of the 13 consecutive primes (5 + 7 + 11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47), Motzkin number. [18] A Lucas and Fibonacci pseudoprime. See 323 (disambiguation)
324 = 22 × 34 = 182. 324 is the sum of four consecutive primes (73 + 79 + 83 + 89), totient sum of the first 32 integers, a square number, [19] and an untouchable number. [16]
325 = 52 × 13. 325 is a triangular number, hexagonal number, [20] nonagonal number, [21] centered nonagonal number. [22] 325 is the smallest number to be the sum of two squares in 3 different ways: 12 + 182, 62 + 172 and 102 + 152. 325 is also the smallest (and only known) 3- hyperperfect number.
326 = 2 × 163. 326 is a nontotient, noncototient, [23] and an untouchable number. [16] 326 is the sum of the 14 consecutive primes (3 + 5 + 7 + 11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47), lazy caterer number [24]
327 = 3 × 109. 327 is a perfect totient number, [25] number of compositions of 10 whose run-lengths are either weakly increasing or weakly decreasing [26]
328 = 23 × 41. 328 is a refactorable number, [27] and it is the sum of the first fifteen primes (2 + 3 + 5 + 7 + 11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47).
329 = 7 × 47. 329 is the sum of three consecutive primes (107 + 109 + 113), and a highly cototient number. [28]
330 = 2 × 3 × 5 × 11. 330 is sum of six consecutive primes (43 + 47 + 53 + 59 + 61 + 67), pentatope number (and hence a binomial coefficient ), a pentagonal number, [29] divisible by the number of primes below it, and a sparsely totient number. [30]
331 is a prime number, super-prime, cuban prime, [31] a lucky prime, [32] sum of five consecutive primes (59 + 61 + 67 + 71 + 73), centered pentagonal number, [33] centered hexagonal number, [34] and Mertens function returns 0. [35]
332 = 22 × 83, Mertens function returns 0. [35]
333 = 32 × 37, Mertens function returns 0; [35] repdigit; 2333 is the smallest power of two greater than a googol.
334 = 2 × 167, nontotient. [36]
335 = 5 × 67, divisible by the number of primes below it, number of Lyndon words of length 12.
336 = 24 × 3 × 7, untouchable number, [16] number of partitions of 41 into prime parts. [37]
337, prime number, emirp, permutable prime with 373 and 733, Chen prime, [8] star number
338 = 2 × 132, nontotient, number of square (0,1)-matrices without zero rows and with exactly 4 entries equal to 1. [38]
339 = 3 × 113, Ulam number [39]
340 = 22 × 5 × 17, sum of eight consecutive primes (29 + 31 + 37 + 41 + 43 + 47 + 53 + 59), sum of ten consecutive primes (17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53), sum of the first four powers of 4 (41 + 42 + 43 + 44), divisible by the number of primes below it, nontotient, noncototient. [23] Number of regions formed by drawing the line segments connecting any two of the 12 perimeter points of a 3 times 3 grid of squares (sequence A331452 in the OEIS) and (sequence A255011 in the OEIS).
341 = 11 × 31, sum of seven consecutive primes (37 + 41 + 43 + 47 + 53 + 59 + 61), octagonal number, [40] centered cube number, [41] super-Poulet number. 341 is the smallest Fermat pseudoprime; it is the least composite odd modulus m greater than the base b, that satisfies the Fermat property "bm−1 − 1 is divisible by m", for bases up to 128 of b = 2, 15, 60, 63, 78, and 108.
342 = 2 × 32 × 19, pronic number, [42] Untouchable number. [16]
343 = 73, the first nice Friedman number that is composite since 343 = (3 + 4)3. It is the only known example of x2+x+1 = y3, in this case, x=18, y=7. It is z3 in a triplet (x,y,z) such that x5 + y2 = z3.
344 = 23 × 43, octahedral number, [43] noncototient, [23] totient sum of the first 33 integers, refactorable number. [27]
345 = 3 × 5 × 23, sphenic number, [15] idoneal number
346 = 2 × 173, Smith number, [11] noncototient. [23]
347 is a prime number, emirp, safe prime, [44] Eisenstein prime with no imaginary part, Chen prime, [8] Friedman prime since 347 = 73 + 4, twin prime with 349, and a strictly non-palindromic number.
348 = 22 × 3 × 29, sum of four consecutive primes (79 + 83 + 89 + 97), refactorable number. [27]
349 is a prime number, the sum of three consecutive primes (109 + 113 + 127), 5349 - 4349, = 349, [45] lucky prime, and a twin prime with 347.
350 = 2 × 52 × 7 = , primitive semiperfect number, [46] divisible by the number of primes below it, nontotient, a truncated icosahedron of frequency 6 has 350 hexagonal faces and 12 pentagonal faces.
351 = 33 × 13, triangular number, sum of five consecutive primes (61 + 67 + 71 + 73 + 79), member of Padovan sequence [47] and number of compositions of 15 into distinct parts. [48]
352 = 25 × 11, the number of n-Queens Problem solutions for n = 9. It is the sum of two consecutive primes (173 + 179), lazy caterer number [24]
354 = 2 × 3 × 59 = 14 + 24 + 34 + 44, [49] [50] sphenic number, [15] nontotient, also SMTP code meaning start of mail input. It is also sum of absolute value of the coefficients of Conway's polynomial.
355 = 5 × 71, Smith number, [11] Mertens function returns 0, [35] divisible by the number of primes below it.
The numerator of the best simplified rational approximation of pi having a denominator of four digits or fewer. This fraction (355/113) is known as Milü and provides an extremely accurate approximation for pi.
356 = 22 × 89, Mertens function returns 0. [35]
357 = 3 × 7 × 17, sphenic number. [15]
358 = 2 × 179, sum of six consecutive primes (47 + 53 + 59 + 61 + 67 + 71), Mertens function returns 0, [35] number of ways to partition {1,2,3,4,5} and then partition each cell (block) into subcells. [51]
361 = 192, centered triangular number, [6] centered octagonal number, centered decagonal number, [52] member of the Mian–Chowla sequence; [53] also the number of positions on a standard 19 x 19 Go board.
362 = 2 × 181 = σ2(19): sum of squares of divisors of 19, [54] Mertens function returns 0, [35] nontotient, noncototient. [23]
364 = 22 × 7 × 13, tetrahedral number, [55] sum of twelve consecutive primes (11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53), Mertens function returns 0, [35] nontotient. It is a repdigit in base 3 (111111), base 9 (444), base 25 (EE), base 27 (DD), base 51 (77) and base 90 (44), the sum of six consecutive powers of 3 (1 + 3 + 9 + 27 + 81 + 243), and because it is the twelfth non-zero tetrahedral number. [55]
366 = 2 × 3 × 61, sphenic number, [15] Mertens function returns 0, [35] noncototient, [23] number of complete partitions of 20, [56] 26-gonal and 123-gonal. Also the number of days in a leap year.
367 is a prime number, a lucky prime, [32] Perrin number, [57] happy number, prime index prime and a strictly non-palindromic number.
368 = 24 × 23. It is also a Leyland number. [13]
370 = 2 × 5 × 37, sphenic number, [15] sum of four consecutive primes (83 + 89 + 97 + 101), nontotient, with 369 part of a Ruth–Aaron pair with only distinct prime factors counted, Base 10 Armstrong number since 33 + 73 + 03 = 370.
371 = 7 × 53, sum of three consecutive primes (113 + 127 + 131), sum of seven consecutive primes (41 + 43 + 47 + 53 + 59 + 61 + 67), sum of the primes from its least to its greatest prime factor, [58] the next such composite number is 2935561623745, Armstrong number since 33 + 73 + 13 = 371.
372 = 22 × 3 × 31, sum of eight consecutive primes (31 + 37 + 41 + 43 + 47 + 53 + 59 + 61), noncototient, [23] untouchable number, [16] --> refactorable number. [27]
373 is a prime number, balanced prime, [59] one of the rare primes to be both right and left-truncatable ( two-sided prime), [9] sum of five consecutive primes (67 + 71 + 73 + 79 + 83), permutable prime with 337 and 733, palindromic prime in 3 consecutive bases: 5658 = 4549 = 37310 and also in base 4: 113114.
374 = 2 × 11 × 17, sphenic number, [15] nontotient, 3744 + 1 is prime. [60]
375 = 3 × 53, number of regions in regular 11-gon with all diagonals drawn. [61]
376 = 23 × 47, pentagonal number, [29] 1- automorphic number, [62] nontotient, refactorable number. [27] There is a math puzzle in which when 376 is squared, 376 is also the last three digits, as 376 * 376 = 141376 [63]
377 = 13 × 29, Fibonacci number, a centered octahedral number, [64] a Lucas and Fibonacci pseudoprime, the sum of the squares of the first six primes.
378 = 2 × 33 × 7, triangular number, cake number, hexagonal number, [20] Smith number. [11]
379 is a prime number, Chen prime, [8] lazy caterer number [24] and a happy number in base 10. It is the sum of the 15 consecutive primes (3 + 5 + 7 + 11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53). 379! - 1 is prime.
380 = 22 × 5 × 19, pronic number, [42] Number of regions into which a figure made up of a row of 6 adjacent congruent rectangles is divided upon drawing diagonals of all possible rectangles. [65]
381 = 3 × 127, palindromic in base 2 and base 8.
It is the sum of the first 16 prime numbers (2 + 3 + 5 + 7 + 11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53).
382 = 2 × 191, sum of ten consecutive primes (19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53 + 59), Smith number. [11]
383, prime number, safe prime, [44] Woodall prime, [66] Thabit number, Eisenstein prime with no imaginary part, palindromic prime. It is also the first number where the sum of a prime and the reversal of the prime is also a prime. [67] 4383 - 3383 is prime.
385 = 5 × 7 × 11, sphenic number, [15] square pyramidal number, [68] the number of integer partitions of 18.
385 = 102 + 92 + 82 + 72 + 62 + 52 + 42 + 32 + 22 + 12
386 = 2 × 193, nontotient, noncototient, [23] centered heptagonal number, [7] number of surface points on a cube with edge-length 9. [69]
387 = 32 × 43, number of graphical partitions of 22. [70]
388 = 22 × 97 = solution to postage stamp problem with 6 stamps and 6 denominations, [71] number of uniform rooted trees with 10 nodes. [72]
389, prime number, emirp, Eisenstein prime with no imaginary part, Chen prime, [8] highly cototient number, [28] strictly non-palindromic number. Smallest conductor of a rank 2 Elliptic curve.
390 = 2 × 3 × 5 × 13, sum of four consecutive primes (89 + 97 + 101 + 103), nontotient,
391 = 17 × 23, Smith number, [11] centered pentagonal number. [33]
392 = 23 × 72, Achilles number.
393 = 3 × 131, Blum integer, Mertens function returns 0. [35]
394 = 2 × 197 = S5 a Schröder number, [74] nontotient, noncototient. [23]
395 = 5 × 79, sum of three consecutive primes (127 + 131 + 137), sum of five consecutive primes (71 + 73 + 79 + 83 + 89), number of (unordered, unlabeled) rooted trimmed trees with 11 nodes. [75]
396 = 22 × 32 × 11, sum of twin primes (197 + 199), totient sum of the first 36 integers, refactorable number, [27] Harshad number, digit-reassembly number.
397, prime number, cuban prime, [31] centered hexagonal number. [34]
398 = 2 × 199, nontotient.
399 = 3 × 7 × 19, sphenic number, [15] smallest Lucas–Carmichael number, Leyland number of the second kind. 399! + 1 is prime.
![]() | A request that this article title be changed to
300-399 (numbers) is
under discussion. Please do not move this article until the discussion is closed. |
This article needs additional citations for
verification. (May 2016) |
| ||||
---|---|---|---|---|
Cardinal | three hundred | |||
Ordinal | 300th (three hundredth) | |||
Factorization | 22 × 3 × 52 | |||
Greek numeral | Τ´ | |||
Roman numeral | CCC | |||
Binary | 1001011002 | |||
Ternary | 1020103 | |||
Senary | 12206 | |||
Octal | 4548 | |||
Duodecimal | 21012 | |||
Hexadecimal | 12C16 | |||
Hebrew | ש | |||
Armenian | Յ | |||
Babylonian cuneiform | 𒐙 | |||
Egyptian hieroglyph | 𓍤 |
300 (three hundred) is the natural number following 299 and preceding 301.
The number 300 is a triangular number and the sum of a pair of twin primes (149 + 151), as well as the sum of ten consecutive primes (13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47). It is palindromic in 3 consecutive bases: 30010 = 6067 = 4548 = 3639, and also in base 13. Factorization is 22 × 3 × 52. 30064 + 1 is prime
309 = 3 × 103, Blum integer, number of primes <= 211. [1] As of April 2024 [update], it is the lowest number to not have an article in Wikipedia, [2] possibly making it interesting in the interesting number paradox.
312 = 23 × 3 × 13, idoneal number.
314 = 2 × 157. 314 is a nontotient, [3] smallest composite number in Somos-4 sequence. [4]
315 = 32 × 5 × 7 = rencontres number, highly composite odd number, having 12 divisors. [5]
316 = 22 × 79, a centered triangular number [6] and a centered heptagonal number. [7]
317 is a prime number, Eisenstein prime with no imaginary part, Chen prime, [8] one of the rare primes to be both right and left-truncatable, [9] and a strictly non-palindromic number.
317 is the exponent (and number of ones) in the fourth base-10 repunit prime. [10]
319 = 11 × 29. 319 is the sum of three consecutive primes (103 + 107 + 109), Smith number, [11] cannot be represented as the sum of fewer than 19 fourth powers, happy number in base 10 [12]
320 = 26 × 5 = (25) × (2 × 5). 320 is a Leyland number, [13] and maximum determinant of a 10 by 10 matrix of zeros and ones.
321 = 3 × 107, a Delannoy number [14]
322 = 2 × 7 × 23. 322 is a sphenic, [15] nontotient, untouchable, [16] and a Lucas number. [17]
323 = 17 × 19. 323 is the sum of nine consecutive primes (19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53), the sum of the 13 consecutive primes (5 + 7 + 11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47), Motzkin number. [18] A Lucas and Fibonacci pseudoprime. See 323 (disambiguation)
324 = 22 × 34 = 182. 324 is the sum of four consecutive primes (73 + 79 + 83 + 89), totient sum of the first 32 integers, a square number, [19] and an untouchable number. [16]
325 = 52 × 13. 325 is a triangular number, hexagonal number, [20] nonagonal number, [21] centered nonagonal number. [22] 325 is the smallest number to be the sum of two squares in 3 different ways: 12 + 182, 62 + 172 and 102 + 152. 325 is also the smallest (and only known) 3- hyperperfect number.
326 = 2 × 163. 326 is a nontotient, noncototient, [23] and an untouchable number. [16] 326 is the sum of the 14 consecutive primes (3 + 5 + 7 + 11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47), lazy caterer number [24]
327 = 3 × 109. 327 is a perfect totient number, [25] number of compositions of 10 whose run-lengths are either weakly increasing or weakly decreasing [26]
328 = 23 × 41. 328 is a refactorable number, [27] and it is the sum of the first fifteen primes (2 + 3 + 5 + 7 + 11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47).
329 = 7 × 47. 329 is the sum of three consecutive primes (107 + 109 + 113), and a highly cototient number. [28]
330 = 2 × 3 × 5 × 11. 330 is sum of six consecutive primes (43 + 47 + 53 + 59 + 61 + 67), pentatope number (and hence a binomial coefficient ), a pentagonal number, [29] divisible by the number of primes below it, and a sparsely totient number. [30]
331 is a prime number, super-prime, cuban prime, [31] a lucky prime, [32] sum of five consecutive primes (59 + 61 + 67 + 71 + 73), centered pentagonal number, [33] centered hexagonal number, [34] and Mertens function returns 0. [35]
332 = 22 × 83, Mertens function returns 0. [35]
333 = 32 × 37, Mertens function returns 0; [35] repdigit; 2333 is the smallest power of two greater than a googol.
334 = 2 × 167, nontotient. [36]
335 = 5 × 67, divisible by the number of primes below it, number of Lyndon words of length 12.
336 = 24 × 3 × 7, untouchable number, [16] number of partitions of 41 into prime parts. [37]
337, prime number, emirp, permutable prime with 373 and 733, Chen prime, [8] star number
338 = 2 × 132, nontotient, number of square (0,1)-matrices without zero rows and with exactly 4 entries equal to 1. [38]
339 = 3 × 113, Ulam number [39]
340 = 22 × 5 × 17, sum of eight consecutive primes (29 + 31 + 37 + 41 + 43 + 47 + 53 + 59), sum of ten consecutive primes (17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53), sum of the first four powers of 4 (41 + 42 + 43 + 44), divisible by the number of primes below it, nontotient, noncototient. [23] Number of regions formed by drawing the line segments connecting any two of the 12 perimeter points of a 3 times 3 grid of squares (sequence A331452 in the OEIS) and (sequence A255011 in the OEIS).
341 = 11 × 31, sum of seven consecutive primes (37 + 41 + 43 + 47 + 53 + 59 + 61), octagonal number, [40] centered cube number, [41] super-Poulet number. 341 is the smallest Fermat pseudoprime; it is the least composite odd modulus m greater than the base b, that satisfies the Fermat property "bm−1 − 1 is divisible by m", for bases up to 128 of b = 2, 15, 60, 63, 78, and 108.
342 = 2 × 32 × 19, pronic number, [42] Untouchable number. [16]
343 = 73, the first nice Friedman number that is composite since 343 = (3 + 4)3. It is the only known example of x2+x+1 = y3, in this case, x=18, y=7. It is z3 in a triplet (x,y,z) such that x5 + y2 = z3.
344 = 23 × 43, octahedral number, [43] noncototient, [23] totient sum of the first 33 integers, refactorable number. [27]
345 = 3 × 5 × 23, sphenic number, [15] idoneal number
346 = 2 × 173, Smith number, [11] noncototient. [23]
347 is a prime number, emirp, safe prime, [44] Eisenstein prime with no imaginary part, Chen prime, [8] Friedman prime since 347 = 73 + 4, twin prime with 349, and a strictly non-palindromic number.
348 = 22 × 3 × 29, sum of four consecutive primes (79 + 83 + 89 + 97), refactorable number. [27]
349 is a prime number, the sum of three consecutive primes (109 + 113 + 127), 5349 - 4349, = 349, [45] lucky prime, and a twin prime with 347.
350 = 2 × 52 × 7 = , primitive semiperfect number, [46] divisible by the number of primes below it, nontotient, a truncated icosahedron of frequency 6 has 350 hexagonal faces and 12 pentagonal faces.
351 = 33 × 13, triangular number, sum of five consecutive primes (61 + 67 + 71 + 73 + 79), member of Padovan sequence [47] and number of compositions of 15 into distinct parts. [48]
352 = 25 × 11, the number of n-Queens Problem solutions for n = 9. It is the sum of two consecutive primes (173 + 179), lazy caterer number [24]
354 = 2 × 3 × 59 = 14 + 24 + 34 + 44, [49] [50] sphenic number, [15] nontotient, also SMTP code meaning start of mail input. It is also sum of absolute value of the coefficients of Conway's polynomial.
355 = 5 × 71, Smith number, [11] Mertens function returns 0, [35] divisible by the number of primes below it.
The numerator of the best simplified rational approximation of pi having a denominator of four digits or fewer. This fraction (355/113) is known as Milü and provides an extremely accurate approximation for pi.
356 = 22 × 89, Mertens function returns 0. [35]
357 = 3 × 7 × 17, sphenic number. [15]
358 = 2 × 179, sum of six consecutive primes (47 + 53 + 59 + 61 + 67 + 71), Mertens function returns 0, [35] number of ways to partition {1,2,3,4,5} and then partition each cell (block) into subcells. [51]
361 = 192, centered triangular number, [6] centered octagonal number, centered decagonal number, [52] member of the Mian–Chowla sequence; [53] also the number of positions on a standard 19 x 19 Go board.
362 = 2 × 181 = σ2(19): sum of squares of divisors of 19, [54] Mertens function returns 0, [35] nontotient, noncototient. [23]
364 = 22 × 7 × 13, tetrahedral number, [55] sum of twelve consecutive primes (11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53), Mertens function returns 0, [35] nontotient. It is a repdigit in base 3 (111111), base 9 (444), base 25 (EE), base 27 (DD), base 51 (77) and base 90 (44), the sum of six consecutive powers of 3 (1 + 3 + 9 + 27 + 81 + 243), and because it is the twelfth non-zero tetrahedral number. [55]
366 = 2 × 3 × 61, sphenic number, [15] Mertens function returns 0, [35] noncototient, [23] number of complete partitions of 20, [56] 26-gonal and 123-gonal. Also the number of days in a leap year.
367 is a prime number, a lucky prime, [32] Perrin number, [57] happy number, prime index prime and a strictly non-palindromic number.
368 = 24 × 23. It is also a Leyland number. [13]
370 = 2 × 5 × 37, sphenic number, [15] sum of four consecutive primes (83 + 89 + 97 + 101), nontotient, with 369 part of a Ruth–Aaron pair with only distinct prime factors counted, Base 10 Armstrong number since 33 + 73 + 03 = 370.
371 = 7 × 53, sum of three consecutive primes (113 + 127 + 131), sum of seven consecutive primes (41 + 43 + 47 + 53 + 59 + 61 + 67), sum of the primes from its least to its greatest prime factor, [58] the next such composite number is 2935561623745, Armstrong number since 33 + 73 + 13 = 371.
372 = 22 × 3 × 31, sum of eight consecutive primes (31 + 37 + 41 + 43 + 47 + 53 + 59 + 61), noncototient, [23] untouchable number, [16] --> refactorable number. [27]
373 is a prime number, balanced prime, [59] one of the rare primes to be both right and left-truncatable ( two-sided prime), [9] sum of five consecutive primes (67 + 71 + 73 + 79 + 83), permutable prime with 337 and 733, palindromic prime in 3 consecutive bases: 5658 = 4549 = 37310 and also in base 4: 113114.
374 = 2 × 11 × 17, sphenic number, [15] nontotient, 3744 + 1 is prime. [60]
375 = 3 × 53, number of regions in regular 11-gon with all diagonals drawn. [61]
376 = 23 × 47, pentagonal number, [29] 1- automorphic number, [62] nontotient, refactorable number. [27] There is a math puzzle in which when 376 is squared, 376 is also the last three digits, as 376 * 376 = 141376 [63]
377 = 13 × 29, Fibonacci number, a centered octahedral number, [64] a Lucas and Fibonacci pseudoprime, the sum of the squares of the first six primes.
378 = 2 × 33 × 7, triangular number, cake number, hexagonal number, [20] Smith number. [11]
379 is a prime number, Chen prime, [8] lazy caterer number [24] and a happy number in base 10. It is the sum of the 15 consecutive primes (3 + 5 + 7 + 11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53). 379! - 1 is prime.
380 = 22 × 5 × 19, pronic number, [42] Number of regions into which a figure made up of a row of 6 adjacent congruent rectangles is divided upon drawing diagonals of all possible rectangles. [65]
381 = 3 × 127, palindromic in base 2 and base 8.
It is the sum of the first 16 prime numbers (2 + 3 + 5 + 7 + 11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53).
382 = 2 × 191, sum of ten consecutive primes (19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53 + 59), Smith number. [11]
383, prime number, safe prime, [44] Woodall prime, [66] Thabit number, Eisenstein prime with no imaginary part, palindromic prime. It is also the first number where the sum of a prime and the reversal of the prime is also a prime. [67] 4383 - 3383 is prime.
385 = 5 × 7 × 11, sphenic number, [15] square pyramidal number, [68] the number of integer partitions of 18.
385 = 102 + 92 + 82 + 72 + 62 + 52 + 42 + 32 + 22 + 12
386 = 2 × 193, nontotient, noncototient, [23] centered heptagonal number, [7] number of surface points on a cube with edge-length 9. [69]
387 = 32 × 43, number of graphical partitions of 22. [70]
388 = 22 × 97 = solution to postage stamp problem with 6 stamps and 6 denominations, [71] number of uniform rooted trees with 10 nodes. [72]
389, prime number, emirp, Eisenstein prime with no imaginary part, Chen prime, [8] highly cototient number, [28] strictly non-palindromic number. Smallest conductor of a rank 2 Elliptic curve.
390 = 2 × 3 × 5 × 13, sum of four consecutive primes (89 + 97 + 101 + 103), nontotient,
391 = 17 × 23, Smith number, [11] centered pentagonal number. [33]
392 = 23 × 72, Achilles number.
393 = 3 × 131, Blum integer, Mertens function returns 0. [35]
394 = 2 × 197 = S5 a Schröder number, [74] nontotient, noncototient. [23]
395 = 5 × 79, sum of three consecutive primes (127 + 131 + 137), sum of five consecutive primes (71 + 73 + 79 + 83 + 89), number of (unordered, unlabeled) rooted trimmed trees with 11 nodes. [75]
396 = 22 × 32 × 11, sum of twin primes (197 + 199), totient sum of the first 36 integers, refactorable number, [27] Harshad number, digit-reassembly number.
397, prime number, cuban prime, [31] centered hexagonal number. [34]
398 = 2 × 199, nontotient.
399 = 3 × 7 × 19, sphenic number, [15] smallest Lucas–Carmichael number, Leyland number of the second kind. 399! + 1 is prime.