fbpx
Wikipedia

300 (number)

July 10, 2023

300 (three hundred) is the natural number following 299 and preceding 301.

Cardinalthree hundred
Ordinal300th
(three hundredth)
Factorization22 × 3 × 52
Greek numeralΤ´
Roman numeralCCC
Binary1001011002
Ternary1020103
Senary12206
Octal4548
Duodecimal21012
Hexadecimal12C16
Hebrewש (Shin)

Mathematical properties

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

Integers from 301 to 399

300s

301

301 = 7 × 43 =  . 301 is the sum of three consecutive primes (97 + 101 + 103), happy number in base 10,[1] lazy caterer number (sequence A000124 in the OEIS).

302

302 = 2 × 151. 302 is a nontotient,[2] a happy number,[1] the number of partitions of 40 into prime parts[3]

303

303 = 3 × 101. 303 is a palindromic semiprime. The number of compositions of 10 which cannot be viewed as stacks is 303.[4]

304

304 = 24 × 19. 304 is the sum of six consecutive primes (41 + 43 + 47 + 53 + 59 + 61), sum of eight consecutive primes (23 + 29 + 31 + 37 + 41 + 43 + 47 + 53), primitive semiperfect number,[5] untouchable number,[6] nontotient.[2] 304 is the smallest number such that no square has a set of digits complementary to the digits of the square of 304: The square of 304 is 92416, while no square exists using the set of the complementary digits 03578.

305

305 = 5 × 61. 305 is the convolution of the first 7 primes with themselves.[7]

306

306 = 2 × 32 × 17. 306 is the sum of four consecutive primes (71 + 73 + 79 + 83), pronic number,[8] and an untouchable number.[6]

307

307 is a prime number, Chen prime,[9] number of one-sided octiamonds[10]

308

308 = 22 × 7 × 11. 308 is a nontotient,[2] totient sum of the first 31 integers, heptagonal pyramidal number,[11] and the sum of two consecutive primes (151 + 157).

309

309 = 3 × 103, Blum integer, number of primes <= 211.[12]

310s

310

310 = 2 × 5 × 31. 310 is a sphenic number,[13] noncototient,[14] number of Dyck 11-paths with strictly increasing peaks.[15]

311

Main article: 311 (number)

311 is a prime number. 4311 - 3311 is prime

312

312 = 23 × 3 × 13, idoneal number.

313

Main article: 313 (number)

313 is a prime number.

314

314 = 2 × 157. 314 is a nontotient,[2] smallest composite number in Somos-4 sequence.[16]

315

315 = 32 × 5 × 7 =   rencontres number, highly composite odd number, having 12 divisors.[17]

316

316 = 22 × 79. 316 is a centered triangular number[18] and a centered heptagonal number[19]

317

317 is a prime number, Eisenstein prime with no imaginary part, Chen prime,[9] and a strictly non-palindromic number.

317 is the exponent (and number of ones) in the fourth base-10 repunit prime.[20]

318

Main article: 318 (number)

318 = 2 × 3 × 53. It is a sphenic number,[13] nontotient,[2] and the sum of twelve consecutive primes (7 + 11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47)

319

319 = 11 × 29. 319 is the sum of three consecutive primes (103 + 107 + 109), Smith number,[21] cannot be represented as the sum of fewer than 19 fourth powers, happy number in base 10[1]

320s

320

320 = 26 × 5 = (25) × (2 × 5). 320 is a Leyland number,[22] and maximum determinant of a 10 by 10 matrix of zeros and ones.

321

321 = 3 × 107, a Delannoy number[23]

322

322 = 2 × 7 × 23. 322 is a sphenic,[13] nontotient, untouchable,[6] and a Lucas number.[24]

323

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.[25] A Lucas and Fibonacci pseudoprime. See 323 (disambiguation)

324

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,[26] and an untouchable number.[6]

325

325 = 52 × 13. 325 is a triangular number, hexagonal number,[27] nonagonal number,[28] centered nonagonal number.[29] 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

326 = 2 × 163. 326 is a nontotient, noncototient,[14] and an untouchable number.[6] 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 (sequence A000124 in the OEIS).

327

327 = 3 × 109. 327 is a perfect totient number,[30] number of compositions of 10 whose run-lengths are either weakly increasing or weakly decreasing[31]

328

328 = 23 × 41. 328 is a refactorable number,[32] 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

329 = 7 × 47. 329 is the sum of three consecutive primes (107 + 109 + 113), and a highly cototient number.[33]

330s

330

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,[34] divisible by the number of primes below it, and a sparsely totient number.[35]

331

331 is a prime number, super-prime, cuban prime,[36] sum of five consecutive primes (59 + 61 + 67 + 71 + 73), centered pentagonal number,[37] centered hexagonal number,[38] and Mertens function returns 0.[39]

332

332 = 22 × 83, Mertens function returns 0.[39]

333

333 = 32 × 37, Mertens function returns 0,[39]

334

334 = 2 × 167, nontotient.[40]

335

335 = 5 × 67, divisible by the number of primes below it, number of Lyndon words of length 12.

336

336 = 24 × 3 × 7, untouchable number,[6] number of partitions of 41 into prime parts.[3]

337

337, prime number, emirp, permutable prime with 373 and 733, Chen prime,[9] star number

338

338 = 2 × 132, nontotient, number of square (0,1)-matrices without zero rows and with exactly 4 entries equal to 1.[41]

339

339 = 3 × 113, Ulam number[42]

340s

340

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.[14] 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

341 = 11 × 31, sum of seven consecutive primes (37 + 41 + 43 + 47 + 53 + 59 + 61), octagonal number,[43] centered cube number,[44] 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

342 = 2 × 32 × 19, pronic number,[8] Untouchable number.[6]

343

343 = 73, the first nice Friedman number that is composite since 343 = (3 + 4)3. It's 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

344 = 23 × 43, octahedral number,[45] noncototient,[14] totient sum of the first 33 integers, refactorable number.[32]

345

345 = 3 × 5 × 23, sphenic number,[13] idoneal number

346

346 = 2 × 173, Smith number,[21] noncototient.[14]

347

347 is a prime number, emirp, safe prime,[46] Eisenstein prime with no imaginary part, Chen prime,[9] Friedman prime since 347 = 73 + 4, and a strictly non-palindromic number.

348

348 = 22 × 3 × 29, sum of four consecutive primes (79 + 83 + 89 + 97), refactorable number.[32]

349

349, prime number, sum of three consecutive primes (109 + 113 + 127), 5349 - 4349 is a prime number.[47]

350s

350

350 = 2 × 52 × 7 =  , primitive semiperfect number,[5] divisible by the number of primes below it, nontotient, a truncated icosahedron of frequency 6 has 350 hexagonal faces and 12 pentagonal faces.

351

351 = 33 × 13, triangular number, sum of five consecutive primes (61 + 67 + 71 + 73 + 79), member of Padovan sequence[48] and number of compositions of 15 into distinct parts.[49]

352

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 (sequence A000124 in the OEIS).

353

Main article: 353 (number)

353 is a prime number, Chen prime,[9] Proth prime,[50] Eisenstein prime with no imaginary part, palindromic prime, and Mertens function returns 0.[39] 353 is the base of the smallest 4th power that is the sum of 4 other 4th powers, discovered by Norrie in 1911: 3534 = 304 + 1204 + 2724 + 3154. 353 is an index of a prime Lucas number.[51]

354

354 = 2 × 3 × 59 = 14 + 24 + 34 + 44,[52][53] sphenic number,[13] nontotient, also SMTP code meaning start of mail input. It is also sum of absolute value of the coefficients of Conway's polynomial.

355

355 = 5 × 71, Smith number,[21] Mertens function returns 0,[39] 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

356 = 22 × 89, Mertens function returns 0.[39]

357

357 = 3 × 7 × 17, sphenic number.[13]

358

358 = 2 × 179, sum of six consecutive primes (47 + 53 + 59 + 61 + 67 + 71), Mertens function returns 0,[39] number of ways to partition {1,2,3,4,5} and then partition each cell (block) into subcells.[54]

359

Main article: 359 (number)

359 is a prime number, Sophie Germain prime,[55] safe prime,[46] Eisenstein prime with no imaginary part, Chen prime,[9] and strictly non-palindromic number.

360s

360

Main article: 360 (number)

360 = triangular matchstick number.[56]

361

361 = 192, centered triangular number,[18] centered octagonal number, centered decagonal number,[57] member of the Mian–Chowla sequence;[58] also the number of positions on a standard 19 x 19 Go board.

362

362 = 2 × 181 = σ2(19): sum of squares of divisors of 19,[59] Mertens function returns 0,[39] nontotient, noncototient.[14]

363

Main article: 363 (number)

363 = 3 × 112, sum of nine consecutive primes (23 + 29 + 31 + 37 + 41 + 43 + 47 + 53 + 59), Mertens function returns 0,[39] perfect totient number.[30]

364

364 = 22 × 7 × 13, tetrahedral number,[60] sum of twelve consecutive primes (11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53), Mertens function returns 0,[39] 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.[61]

365

Main article: 365 (number)

365 = 5 × 73

366

366 = 2 × 3 × 61, sphenic number,[13] Mertens function returns 0,[39] noncototient,[14] number of complete partitions of 20,[62] 26-gonal and 123-gonal.

367

367 is a prime number, Perrin number,[63] happy number, prime index prime and a strictly non-palindromic number.

368

368 = 24 × 23. It is also a Leyland number.[22]

369

Main article: 369 (number)

369 = 32 × 41, it is the magic constant of the 9 × 9 normal magic square and n-queens problem for n = 9; there are 369 free polyominoes of order 8. With 370, a Ruth–Aaron pair with only distinct prime factors counted.

370s

370

370 = 2 × 5 × 37, sphenic number,[13] 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

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 (sequence A055233 in the OEIS), the next such composite number is 2935561623745, Armstrong number since 33 + 73 + 13 = 371.

372

372 = 22 × 3 × 31, sum of eight consecutive primes (31 + 37 + 41 + 43 + 47 + 53 + 59 + 61), noncototient,[14] untouchable number,[6] refactorable number.[32]

373

373, prime number, balanced prime,[64] two-sided prime, 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

374 = 2 × 11 × 17, sphenic number,[13] nontotient, 3744 + 1 is prime.[65]

375

375 = 3 × 53, number of regions in regular 11-gon with all diagonals drawn.[66]

376

376 = 23 × 47, pentagonal number,[34] 1-automorphic number,[67] nontotient, refactorable number.[32]

377

377 = 13 × 29, Fibonacci number, a centered octahedral number,[68] a Lucas and Fibonacci pseudoprime, the sum of the squares of the first six primes.

378

378 = 2 × 33 × 7, triangular number, cake number, hexagonal number,[27] Smith number.[21]

379

379 is a prime number, Chen prime,[9] lazy caterer number (sequence A000124 in the OEIS) 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.

380s

380

380 = 22 × 5 × 19, pronic number,[8] 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 OEIS: A306302 and OEIS: A331452.

381

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

382 = 2 × 191, sum of ten consecutive primes (19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53 + 59), Smith number.[21]

383

383, prime number, safe prime,[46] Woodall prime,[69] 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.[70] 4383 - 3383 is prime.

384

Main article: 384 (number)

385

385 = 5 × 7 × 11, sphenic number,[13] square pyramidal number,[71] the number of integer partitions of 18.

385 = 102 + 92 + 82 + 72 + 62 + 52 + 42 + 32 + 22 + 12

386

386 = 2 × 193, nontotient, noncototient,[14] centered heptagonal number,[19] number of surface points on a cube with edge-length 9.[72]

387

387 = 32 × 43, number of graphical partitions of 22.[73]

388

388 = 22 × 97 = solution to postage stamp problem with 6 stamps and 6 denominations,[74] number of uniform rooted trees with 10 nodes.[75]

389

389, prime number, emirp, Eisenstein prime with no imaginary part, Chen prime,[9] highly cototient number,[33] strictly non-palindromic number. Smallest conductor of a rank 2 Elliptic curve.

390s

390

390 = 2 × 3 × 5 × 13, sum of four consecutive primes (89 + 97 + 101 + 103), nontotient,

  is prime[76]

391

391 = 17 × 23, Smith number,[21] centered pentagonal number.[37]

392

392 = 23 × 72, Achilles number.

393

393 = 3 × 131, Blum integer, Mertens function returns 0.[39]

394

394 = 2 × 197 = S5 a Schröder number,[77] nontotient, noncototient.[14]

395

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.[78]

396

396 = 22 × 32 × 11, sum of twin primes (197 + 199), totient sum of the first 36 integers, refactorable number,[32] Harshad number, digit-reassembly number.

397

397, prime number, cuban prime,[36] centered hexagonal number.[38]

398

398 = 2 × 199, nontotient.

  is prime[76]

399

399 = 3 × 7 × 19, sphenic number,[13] smallest Lucas–Carmichael number, Leyland number of the second kind. 399! + 1 is prime.

References

  1. ^ a b c Sloane, N. J. A. (ed.). "Sequence A007770 (Happy numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-21.
  2. ^ a b c d e Sloane, N. J. A. (ed.). "Sequence A005277 (Nontotients)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-21.
  3. ^ a b Sloane, N. J. A. (ed.). "Sequence A000607 (Number of partitions of n into prime parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  4. ^ Sloane, N. J. A. (ed.). "Sequence A115981 (The number of compositions of n which cannot be viewed as stacks)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  5. ^ a b Sloane, N. J. A. (ed.). "Sequence A006036 (Primitive pseudoperfect numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-21.
  6. ^ a b c d e f g h Sloane, N. J. A. (ed.). "Sequence A005114 (Untouchable numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-21.
  7. ^ Sloane, N. J. A. (ed.). "Sequence A014342 (Convolution of primes with themselves)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  8. ^ a b c Sloane, N. J. A. (ed.). "Sequence A002378 (Oblong numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-21.
  9. ^ a b c d e f g h Sloane, N. J. A. (ed.). "Sequence A109611 (Chen primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-21.
  10. ^ Sloane, N. J. A. (ed.). "Sequence A006534". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-10.
  11. ^ Sloane, N. J. A. (ed.). "Sequence A002413 (Heptagonal pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  12. ^ Sloane, N. J. A. (ed.). "Sequence A007053 (Number of primes <= 2^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-06-02.
  13. ^ a b c d e f g h i j k Sloane, N. J. A. (ed.). "Sequence A007304 (Sphenic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-21.
  14. ^ a b c d e f g h i j Sloane, N. J. A. (ed.). "Sequence A005278 (Noncototients)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-21.
  15. ^ Sloane, N. J. A. (ed.). "Sequence A008930 (Number of compositions (p_1, p_2, p_3, ...) of n with 1 <= p_i <= i for all i)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  16. ^ Sloane, N. J. A. (ed.). "Sequence A006720 (Somos-4 sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  17. ^ "A053624 - OEIS". oeis.org.
  18. ^ a b Sloane, N. J. A. (ed.). "Sequence A005448 (Centered triangular numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-21.
  19. ^ a b Sloane, N. J. A. (ed.). "Sequence A069099 (Centered heptagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-21.
  20. ^ Guy, Richard; Unsolved Problems in Number Theory, p. 7 ISBN 1475717385
  21. ^ a b c d e f Sloane, N. J. A. (ed.). "Sequence A006753 (Smith numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-21.
  22. ^ a b Sloane, N. J. A. (ed.). "Sequence A076980 (Leyland numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  23. ^ Sloane, N. J. A. (ed.). "Sequence A001850 (Central Delannoy numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-21.
  24. ^ Sloane, N. J. A. (ed.). "Sequence A000032 (Lucas numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-21.
  25. ^ Sloane, N. J. A. (ed.). "Sequence A001006 (Motzkin numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  26. ^ "A000290 - OEIS". oeis.org. Retrieved 2022-10-23.
  27. ^ a b Sloane, N. J. A. (ed.). "Sequence A000384 (Hexagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  28. ^ Sloane, N. J. A. (ed.). "Sequence A001106 (9-gonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  29. ^ Sloane, N. J. A. (ed.). "Sequence A060544 (Centered 9-gonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  30. ^ a b Sloane, N. J. A. (ed.). "Sequence A082897 (Perfect totient numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  31. ^ Sloane, N. J. A. (ed.). "Sequence A332835 (Number of compositions of n whose run-lengths are either weakly increasing or weakly decreasing)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-06-02.
  32. ^ a b c d e f Sloane, N. J. A. (ed.). "Sequence A033950 (Refactorable numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  33. ^ a b Sloane, N. J. A. (ed.). "Sequence A100827 (Highly cototient numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  34. ^ a b Sloane, N. J. A. (ed.). "Sequence A000326 (Pentagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  35. ^ Sloane, N. J. A. (ed.). "Sequence A036913 (Sparsely totient numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  36. ^ a b Sloane, N. J. A. (ed.). "Sequence A002407 (Cuban primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  37. ^ a b Sloane, N. J. A. (ed.). "Sequence A005891 (Centered pentagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  38. ^ a b Sloane, N. J. A. (ed.). "Sequence A003215 (Hex numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  39. ^ a b c d e f g h i j k l Sloane, N. J. A. (ed.). "Sequence A028442 (Numbers n such that Mertens' function is zero)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  40. ^ Sloane, N. J. A. (ed.). "Sequence A003052 (Self numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-21.
  41. ^ Sloane, N. J. A. (ed.). "Sequence A122400 (Number of square (0,1)-matrices without zero rows and with exactly n entries equal to 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  42. ^ Sloane, N. J. A. (ed.). "Sequence A002858 (Ulam numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  43. ^ Sloane, N. J. A. (ed.). "Sequence A000567 (Octagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  44. ^ Sloane, N. J. A. (ed.). "Sequence A005898 (Centered cube numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  45. ^ Sloane, N. J. A. (ed.). "Sequence A005900 (Octahedral numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  46. ^ a b c Sloane, N. J. A. (ed.). "Sequence A005385 (Safe primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  47. ^ Sloane, N. J. A. (ed.). "Sequence A059802 (Numbers k such that 5^k - 4^k is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  48. ^ Sloane, N. J. A. (ed.). "Sequence A000931 (Padovan sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  49. ^ Sloane, N. J. A. (ed.). "Sequence A032020 (Number of compositions (ordered partitions) of n into distinct parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-24.
  50. ^ Sloane, N. J. A. (ed.). "Sequence A080076 (Proth primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  51. ^ Sloane, N. J. A. (ed.). "Sequence A001606 (Indices of prime Lucas numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  52. ^ Sloane, N. J. A. (ed.). "Sequence A000538 (Sum of fourth powers: 0^4 + 1^4 + ... + n^4)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  53. ^ Sloane, N. J. A. (ed.). "Sequence A031971 (a(n) = Sum_{k=1..n} k^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  54. ^ Sloane, N. J. A. (ed.). "Sequence A000258 (Expansion of e.g.f. exp(exp(exp(x)-1)-1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  55. ^ Sloane, N. J. A. (ed.). "Sequence A005384 (Sophie Germain primes p: 2p+1 is also prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  56. ^ Sloane, N. J. A. (ed.). "Sequence A045943 (Triangular matchstick numbers: a(n) = 3*n*(n+1)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  57. ^ Sloane, N. J. A. (ed.). "Sequence A062786 (Centered 10-gonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  58. ^ Sloane, N. J. A. (ed.). "Sequence A005282 (Mian-Chowla sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  59. ^ Sloane, N. J. A. (ed.). "Sequence A001157 (a(n) = sigma_2(n): sum of squares of divisors of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  60. ^ Sloane, N. J. A. (ed.). "Sequence A000292 (Tetrahedral numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  61. ^ Sloane, N. J. A. (ed.). "Sequence A000292 (Tetrahedral (or triangular pyramidal) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  62. ^ Sloane, N. J. A. (ed.). "Sequence A126796 (Number of complete partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  63. ^ Sloane, N. J. A. (ed.). "Sequence A001608 (Perrin sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  64. ^ Sloane, N. J. A. (ed.). "Sequence A006562 (Balanced primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  65. ^ Sloane, N. J. A. (ed.). "Sequence A000068 (Numbers k such that k^4 + 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  66. ^ Sloane, N. J. A. (ed.). "Sequence A007678 (Number of regions in regular n-gon with all diagonals drawn)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  67. ^ Sloane, N. J. A. (ed.). "Sequence A003226 (Automorphic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  68. ^ Sloane, N. J. A. (ed.). "Sequence A001845 (Centered octahedral numbers (crystal ball sequence for cubic lattice))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-06-02.
  69. ^ Sloane, N. J. A. (ed.). "Sequence A050918 (Woodall primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  70. ^ Sloane, N. J. A. (ed.). "Sequence A072385 (Primes which can be represented as the sum of a prime and its reverse)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2019-06-02.
  71. ^ Sloane, N. J. A. (ed.). "Sequence A000330 (Square pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  72. ^ Sloane, N. J. A. (ed.). "Sequence A005897 (a(n) = 6*n^2 + 2 for n > 0, a(0)=1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  73. ^ Sloane, N. J. A. (ed.). "Sequence A000569 (Number of graphical partitions of 2n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  74. ^ Sloane, N. J. A. (ed.). "Sequence A084192 (Array read by antidiagonals: T(n,k) = solution to postage stamp problem with n stamps and k denominations (n >= 1, k >= 1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  75. ^ Sloane, N. J. A. (ed.). "Sequence A317712 (Number of uniform rooted trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  76. ^ a b Sloane, N. J. A. (ed.). "Sequence A162862 (Numbers n such that n^10 + n^9 + n^8 + n^7 + n^6 + n^5 + n^4 + n^3 + n^2 + n + 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-06-02.
  77. ^ Sloane, N. J. A. (ed.). "Sequence A006318 (Large Schröder numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  78. ^ Sloane, N. J. A. (ed.). "Sequence A002955 (Number of (unordered, unlabeled) rooted trimmed trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

July 10, 2023
number, this, article, needs, additional, citations, verification, please, help, improve, this, article, adding, citations, reliable, sources, unsourced, material, challenged, removed, find, sources, number, news, newspapers, books, scholar, jstor, 2016, learn. This article needs additional citations for verification Please help improve this article by adding citations to reliable sources Unsourced material may be challenged and removed Find sources 300 number news newspapers books scholar JSTOR May 2016 Learn how and when to remove this template message 300 three hundred is the natural number following 299 and preceding 301 299 300 301 List of numbersIntegers 0 100 200 300 400 500 600 700 800 900 Cardinalthree hundredOrdinal300th three hundredth Factorization22 3 52Greek numeralT Roman numeralCCCBinary1001011002Ternary1020103Senary12206Octal4548Duodecimal21012Hexadecimal12C16Hebrewש Shin Contents 1 Mathematical properties 2 Integers from 301 to 399 2 1 300s 2 1 1 301 2 1 2 302 2 1 3 303 2 1 4 304 2 1 5 305 2 1 6 306 2 1 7 307 2 1 8 308 2 1 9 309 2 2 310s 2 2 1 310 2 2 2 311 2 2 3 312 2 2 4 313 2 2 5 314 2 2 6 315 2 2 7 316 2 2 8 317 2 2 9 318 2 2 10 319 2 3 320s 2 3 1 320 2 3 2 321 2 3 3 322 2 3 4 323 2 3 5 324 2 3 6 325 2 3 7 326 2 3 8 327 2 3 9 328 2 3 10 329 2 4 330s 2 4 1 330 2 4 2 331 2 4 3 332 2 4 4 333 2 4 5 334 2 4 6 335 2 4 7 336 2 4 8 337 2 4 9 338 2 4 10 339 2 5 340s 2 5 1 340 2 5 2 341 2 5 3 342 2 5 4 343 2 5 5 344 2 5 6 345 2 5 7 346 2 5 8 347 2 5 9 348 2 5 10 349 2 6 350s 2 6 1 350 2 6 2 351 2 6 3 352 2 6 4 353 2 6 5 354 2 6 6 355 2 6 7 356 2 6 8 357 2 6 9 358 2 6 10 359 2 7 360s 2 7 1 360 2 7 2 361 2 7 3 362 2 7 4 363 2 7 5 364 2 7 6 365 2 7 7 366 2 7 8 367 2 7 9 368 2 7 10 369 2 8 370s 2 8 1 370 2 8 2 371 2 8 3 372 2 8 4 373 2 8 5 374 2 8 6 375 2 8 7 376 2 8 8 377 2 8 9 378 2 8 10 379 2 9 380s 2 9 1 380 2 9 2 381 2 9 3 382 2 9 4 383 2 9 5 384 2 9 6 385 2 9 7 386 2 9 8 387 2 9 9 388 2 9 10 389 2 10 390s 2 10 1 390 2 10 2 391 2 10 3 392 2 10 4 393 2 10 5 394 2 10 6 395 2 10 7 396 2 10 8 397 2 10 9 398 2 10 10 399 3 ReferencesMathematical properties EditThe 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 primeIntegers from 301 to 399 Edit300s Edit 301 Edit 301 7 43 7 3 displaystyle left 7 atop 3 right 301 is the sum of three consecutive primes 97 101 103 happy number in base 10 1 lazy caterer number sequence A000124 in the OEIS 302 Edit 302 2 151 302 is a nontotient 2 a happy number 1 the number of partitions of 40 into prime parts 3 303 Edit 303 3 101 303 is a palindromic semiprime The number of compositions of 10 which cannot be viewed as stacks is 303 4 304 Edit 304 24 19 304 is the sum of six consecutive primes 41 43 47 53 59 61 sum of eight consecutive primes 23 29 31 37 41 43 47 53 primitive semiperfect number 5 untouchable number 6 nontotient 2 304 is the smallest number such that no square has a set of digits complementary to the digits of the square of 304 The square of 304 is 92416 while no square exists using the set of the complementary digits 03578 305 Edit 305 5 61 305 is the convolution of the first 7 primes with themselves 7 306 Edit 306 2 32 17 306 is the sum of four consecutive primes 71 73 79 83 pronic number 8 and an untouchable number 6 307 Edit 307 is a prime number Chen prime 9 number of one sided octiamonds 10 308 Edit 308 22 7 11 308 is a nontotient 2 totient sum of the first 31 integers heptagonal pyramidal number 11 and the sum of two consecutive primes 151 157 309 Edit 309 3 103 Blum integer number of primes lt 211 12 310s Edit 310 Edit 310 2 5 31 310 is a sphenic number 13 noncototient 14 number of Dyck 11 paths with strictly increasing peaks 15 311 Edit Main article 311 number 311 is a prime number 4311 3311 is prime 312 Edit 312 23 3 13 idoneal number 313 Edit Main article 313 number 313 is a prime number 314 Edit 314 2 157 314 is a nontotient 2 smallest composite number in Somos 4 sequence 16 315 Edit 315 32 5 7 D 7 3 displaystyle D 7 3 rencontres number highly composite odd number having 12 divisors 17 316 Edit 316 22 79 316 is a centered triangular number 18 and a centered heptagonal number 19 317 Edit 317 is a prime number Eisenstein prime with no imaginary part Chen prime 9 and a strictly non palindromic number 317 is the exponent and number of ones in the fourth base 10 repunit prime 20 318 Edit Main article 318 number 318 2 3 53 It is a sphenic number 13 nontotient 2 and the sum of twelve consecutive primes 7 11 13 17 19 23 29 31 37 41 43 47 319 Edit 319 11 29 319 is the sum of three consecutive primes 103 107 109 Smith number 21 cannot be represented as the sum of fewer than 19 fourth powers happy number in base 10 1 320s Edit 320 Edit 320 26 5 25 2 5 320 is a Leyland number 22 and maximum determinant of a 10 by 10 matrix of zeros and ones 321 Edit 321 3 107 a Delannoy number 23 322 Edit 322 2 7 23 322 is a sphenic 13 nontotient untouchable 6 and a Lucas number 24 323 Edit 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 25 A Lucas and Fibonacci pseudoprime See 323 disambiguation 324 Edit 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 26 and an untouchable number 6 325 Edit 325 52 13 325 is a triangular number hexagonal number 27 nonagonal number 28 centered nonagonal number 29 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 Edit 326 2 163 326 is a nontotient noncototient 14 and an untouchable number 6 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 sequence A000124 in the OEIS 327 Edit 327 3 109 327 is a perfect totient number 30 number of compositions of 10 whose run lengths are either weakly increasing or weakly decreasing 31 328 Edit 328 23 41 328 is a refactorable number 32 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 Edit 329 7 47 329 is the sum of three consecutive primes 107 109 113 and a highly cototient number 33 330s Edit 330 Edit 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 11 4 displaystyle tbinom 11 4 a pentagonal number 34 divisible by the number of primes below it and a sparsely totient number 35 331 Edit 331 is a prime number super prime cuban prime 36 sum of five consecutive primes 59 61 67 71 73 centered pentagonal number 37 centered hexagonal number 38 and Mertens function returns 0 39 332 Edit 332 22 83 Mertens function returns 0 39 333 Edit 333 32 37 Mertens function returns 0 39 334 Edit 334 2 167 nontotient 40 335 Edit 335 5 67 divisible by the number of primes below it number of Lyndon words of length 12 336 Edit 336 24 3 7 untouchable number 6 number of partitions of 41 into prime parts 3 337 Edit 337 prime number emirp permutable prime with 373 and 733 Chen prime 9 star number 338 Edit 338 2 132 nontotient number of square 0 1 matrices without zero rows and with exactly 4 entries equal to 1 41 339 Edit 339 3 113 Ulam number 42 340s Edit 340 Edit 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 14 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 Edit 341 11 31 sum of seven consecutive primes 37 41 43 47 53 59 61 octagonal number 43 centered cube number 44 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 Edit 342 2 32 19 pronic number 8 Untouchable number 6 343 Edit 343 73 the first nice Friedman number that is composite since 343 3 4 3 It s 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 Edit 344 23 43 octahedral number 45 noncototient 14 totient sum of the first 33 integers refactorable number 32 345 Edit 345 3 5 23 sphenic number 13 idoneal number 346 Edit 346 2 173 Smith number 21 noncototient 14 347 Edit 347 is a prime number emirp safe prime 46 Eisenstein prime with no imaginary part Chen prime 9 Friedman prime since 347 73 4 and a strictly non palindromic number 348 Edit 348 22 3 29 sum of four consecutive primes 79 83 89 97 refactorable number 32 349 Edit 349 prime number sum of three consecutive primes 109 113 127 5349 4349 is a prime number 47 350s Edit 350 Edit 350 2 52 7 7 4 displaystyle left 7 atop 4 right primitive semiperfect number 5 divisible by the number of primes below it nontotient a truncated icosahedron of frequency 6 has 350 hexagonal faces and 12 pentagonal faces 351 Edit 351 33 13 triangular number sum of five consecutive primes 61 67 71 73 79 member of Padovan sequence 48 and number of compositions of 15 into distinct parts 49 352 Edit 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 sequence A000124 in the OEIS 353 Edit Main article 353 number 353 is a prime number Chen prime 9 Proth prime 50 Eisenstein prime with no imaginary part palindromic prime and Mertens function returns 0 39 353 is the base of the smallest 4th power that is the sum of 4 other 4th powers discovered by Norrie in 1911 3534 304 1204 2724 3154 353 is an index of a prime Lucas number 51 354 Edit 354 2 3 59 14 24 34 44 52 53 sphenic number 13 nontotient also SMTP code meaning start of mail input It is also sum of absolute value of the coefficients of Conway s polynomial 355 Edit 355 5 71 Smith number 21 Mertens function returns 0 39 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 Milu and provides an extremely accurate approximation for pi 356 Edit 356 22 89 Mertens function returns 0 39 357 Edit 357 3 7 17 sphenic number 13 358 Edit 358 2 179 sum of six consecutive primes 47 53 59 61 67 71 Mertens function returns 0 39 number of ways to partition 1 2 3 4 5 and then partition each cell block into subcells 54 359 Edit Main article 359 number 359 is a prime number Sophie Germain prime 55 safe prime 46 Eisenstein prime with no imaginary part Chen prime 9 and strictly non palindromic number 360s Edit 360 Edit Main article 360 number 360 triangular matchstick number 56 361 Edit 361 192 centered triangular number 18 centered octagonal number centered decagonal number 57 member of the Mian Chowla sequence 58 also the number of positions on a standard 19 x 19 Go board 362 Edit 362 2 181 s2 19 sum of squares of divisors of 19 59 Mertens function returns 0 39 nontotient noncototient 14 363 Edit Main article 363 number 363 3 112 sum of nine consecutive primes 23 29 31 37 41 43 47 53 59 Mertens function returns 0 39 perfect totient number 30 364 Edit 364 22 7 13 tetrahedral number 60 sum of twelve consecutive primes 11 13 17 19 23 29 31 37 41 43 47 53 Mertens function returns 0 39 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 61 365 Edit Main article 365 number 365 5 73 366 Edit 366 2 3 61 sphenic number 13 Mertens function returns 0 39 noncototient 14 number of complete partitions of 20 62 26 gonal and 123 gonal 367 Edit 367 is a prime number Perrin number 63 happy number prime index prime and a strictly non palindromic number 368 Edit 368 24 23 It is also a Leyland number 22 369 Edit Main article 369 number 369 32 41 it is the magic constant of the 9 9 normal magic square and n queens problem for n 9 there are 369 free polyominoes of order 8 With 370 a Ruth Aaron pair with only distinct prime factors counted 370s Edit 370 Edit 370 2 5 37 sphenic number 13 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 Edit 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 sequence A055233 in the OEIS the next such composite number is 2935561623745 Armstrong number since 33 73 13 371 372 Edit 372 22 3 31 sum of eight consecutive primes 31 37 41 43 47 53 59 61 noncototient 14 untouchable number 6 refactorable number 32 373 Edit 373 prime number balanced prime 64 two sided prime 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 Edit 374 2 11 17 sphenic number 13 nontotient 3744 1 is prime 65 375 Edit 375 3 53 number of regions in regular 11 gon with all diagonals drawn 66 376 Edit 376 23 47 pentagonal number 34 1 automorphic number 67 nontotient refactorable number 32 377 Edit 377 13 29 Fibonacci number a centered octahedral number 68 a Lucas and Fibonacci pseudoprime the sum of the squares of the first six primes 378 Edit 378 2 33 7 triangular number cake number hexagonal number 27 Smith number 21 379 Edit 379 is a prime number Chen prime 9 lazy caterer number sequence A000124 in the OEIS 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 380s Edit 380 Edit 380 22 5 19 pronic number 8 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 OEIS A306302 and OEIS A331452 381 Edit 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 Edit 382 2 191 sum of ten consecutive primes 19 23 29 31 37 41 43 47 53 59 Smith number 21 383 Edit 383 prime number safe prime 46 Woodall prime 69 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 70 4383 3383 is prime 384 Edit Main article 384 number 385 Edit 385 5 7 11 sphenic number 13 square pyramidal number 71 the number of integer partitions of 18 385 102 92 82 72 62 52 42 32 22 12 386 Edit 386 2 193 nontotient noncototient 14 centered heptagonal number 19 number of surface points on a cube with edge length 9 72 387 Edit 387 32 43 number of graphical partitions of 22 73 388 Edit 388 22 97 solution to postage stamp problem with 6 stamps and 6 denominations 74 number of uniform rooted trees with 10 nodes 75 389 Edit 389 prime number emirp Eisenstein prime with no imaginary part Chen prime 9 highly cototient number 33 strictly non palindromic number Smallest conductor of a rank 2 Elliptic curve 390s Edit 390 Edit 390 2 3 5 13 sum of four consecutive primes 89 97 101 103 nontotient n 0 10 390 n displaystyle sum n 0 10 390 n is prime 76 391 Edit 391 17 23 Smith number 21 centered pentagonal number 37 392 Edit 392 23 72 Achilles number 393 Edit 393 3 131 Blum integer Mertens function returns 0 39 394 Edit 394 2 197 S5 a Schroder number 77 nontotient noncototient 14 395 Edit 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 78 396 Edit 396 22 32 11 sum of twin primes 197 199 totient sum of the first 36 integers refactorable number 32 Harshad number digit reassembly number 397 Edit 397 prime number cuban prime 36 centered hexagonal number 38 398 Edit 398 2 199 nontotient n 0 10 398 n displaystyle sum n 0 10 398 n is prime 76 399 Edit 399 3 7 19 sphenic number 13 smallest Lucas Carmichael number Leyland number of the second kind 399 1 is prime References Edit a b c Sloane N J A ed Sequence A007770 Happy numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 21 a b c d e Sloane N J A ed Sequence A005277 Nontotients The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 21 a b Sloane N J A ed Sequence A000607 Number of partitions of n into prime parts The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A115981 The number of compositions of n which cannot be viewed as stacks The On Line Encyclopedia of Integer Sequences OEIS Foundation a b Sloane N J A ed Sequence A006036 Primitive pseudoperfect numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 21 a b c d e f g h Sloane N J A ed Sequence A005114 Untouchable numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 21 Sloane N J A ed Sequence A014342 Convolution of primes with themselves The On Line Encyclopedia of Integer Sequences OEIS Foundation a b c Sloane N J A ed Sequence A002378 Oblong numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 21 a b c d e f g h Sloane N J A ed Sequence A109611 Chen primes The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 21 Sloane N J A ed Sequence A006534 The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2022 05 10 Sloane N J A ed Sequence A002413 Heptagonal pyramidal numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 22 Sloane N J A ed Sequence A007053 Number of primes lt 2 n The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2022 06 02 a b c d e f g h i j k Sloane N J A ed Sequence A007304 Sphenic numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 21 a b c d e f g h i j Sloane N J A ed Sequence A005278 Noncototients The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 21 Sloane N J A ed Sequence A008930 Number of compositions p 1 p 2 p 3 of n with 1 lt p i lt i for all i The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A006720 Somos 4 sequence The On Line Encyclopedia of Integer Sequences OEIS Foundation A053624 OEIS oeis org a b Sloane N J A ed Sequence A005448 Centered triangular numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 21 a b Sloane N J A ed Sequence A069099 Centered heptagonal numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 21 Guy Richard Unsolved Problems in Number Theory p 7 ISBN 1475717385 a b c d e f Sloane N J A ed Sequence A006753 Smith numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 21 a b Sloane N J A ed Sequence A076980 Leyland numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 22 Sloane N J A ed Sequence A001850 Central Delannoy numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 21 Sloane N J A ed Sequence A000032 Lucas numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 21 Sloane N J A ed Sequence A001006 Motzkin numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 22 A000290 OEIS oeis org Retrieved 2022 10 23 a b Sloane N J A ed Sequence A000384 Hexagonal numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 22 Sloane N J A ed Sequence A001106 9 gonal numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 22 Sloane N J A ed Sequence A060544 Centered 9 gonal numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 22 a b Sloane N J A ed Sequence A082897 Perfect totient numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 22 Sloane N J A ed Sequence A332835 Number of compositions of n whose run lengths are either weakly increasing or weakly decreasing The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2022 06 02 a b c d e f Sloane N J A ed Sequence A033950 Refactorable numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 22 a b Sloane N J A ed Sequence A100827 Highly cototient numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 22 a b Sloane N J A ed Sequence A000326 Pentagonal numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 22 Sloane N J A ed Sequence A036913 Sparsely totient numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 22 a b Sloane N J A ed Sequence A002407 Cuban primes The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 22 a b Sloane N J A ed Sequence A005891 Centered pentagonal numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 22 a b Sloane N J A ed Sequence A003215 Hex numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 22 a b c d e f g h i j k l Sloane N J A ed Sequence A028442 Numbers n such that Mertens function is zero The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 22 Sloane N J A ed Sequence A003052 Self numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 21 Sloane N J A ed Sequence A122400 Number of square 0 1 matrices without zero rows and with exactly n entries equal to 1 The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A002858 Ulam numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A000567 Octagonal numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 22 Sloane N J A ed Sequence A005898 Centered cube numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 22 Sloane N J A ed Sequence A005900 Octahedral numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 22 a b c Sloane N J A ed Sequence A005385 Safe primes The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 22 Sloane N J A ed Sequence A059802 Numbers k such that 5 k 4 k is prime The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A000931 Padovan sequence The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 22 Sloane N J A ed Sequence A032020 Number of compositions ordered partitions of n into distinct parts The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2022 05 24 Sloane N J A ed Sequence A080076 Proth primes The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 22 Sloane N J A ed Sequence A001606 Indices of prime Lucas numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A000538 Sum of fourth powers 0 4 1 4 n 4 The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A031971 a n Sum k 1 n k n The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A000258 Expansion of e g f exp exp exp x 1 1 The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A005384 Sophie Germain primes p 2p 1 is also prime The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A045943 Triangular matchstick numbers a n 3 n n 1 2 The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A062786 Centered 10 gonal numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 22 Sloane N J A ed Sequence A005282 Mian Chowla sequence The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 22 Sloane N J A ed Sequence A001157 a n sigma 2 n sum of squares of divisors of n The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A000292 Tetrahedral numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 22 Sloane N J A ed Sequence A000292 Tetrahedral or triangular pyramidal numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A126796 Number of complete partitions of n The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A001608 Perrin sequence The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 22 Sloane N J A ed Sequence A006562 Balanced primes The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 22 Sloane N J A ed Sequence A000068 Numbers k such that k 4 1 is prime The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A007678 Number of regions in regular n gon with all diagonals drawn The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A003226 Automorphic numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 22 Sloane N J A ed Sequence A001845 Centered octahedral numbers crystal ball sequence for cubic lattice The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2022 06 02 Sloane N J A ed Sequence A050918 Woodall primes The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 22 Sloane N J A ed Sequence A072385 Primes which can be represented as the sum of a prime and its reverse The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2019 06 02 Sloane N J A ed Sequence A000330 Square pyramidal numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 22 Sloane N J A ed Sequence A005897 a n 6 n 2 2 for n gt 0 a 0 1 The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A000569 Number of graphical partitions of 2n The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A084192 Array read by antidiagonals T n k solution to postage stamp problem with n stamps and k denominations n gt 1 k gt 1 The On Line Encyclopedia of Integer Sequences OEIS Foundation Sloane N J A ed Sequence A317712 Number of uniform rooted trees with n nodes The On Line Encyclopedia of Integer Sequences OEIS Foundation a b Sloane N J A ed Sequence A162862 Numbers n such that n 10 n 9 n 8 n 7 n 6 n 5 n 4 n 3 n 2 n 1 is prime The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2022 06 02 Sloane N J A ed Sequence A006318 Large Schroder numbers The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved 2016 05 22 Sloane N J A ed Sequence A002955 Number of unordered unlabeled rooted trimmed trees with n nodes The On Line Encyclopedia of Integer Sequences OEIS Foundation Retrieved from https en wikipedia org w index php title 300 number amp oldid 1161412650 366, wikipedia, wiki, book, books, library,

article

, read, download, free, free download, mp3, video, mp4, 3gp, jpg, jpeg, gif, png, picture, music, song, movie, book, game, games.