1,000,001 to 1,999,999 •
1,000,003 = Smallest 7-
digit prime number •
1,000,405 = Smallest
triangular number with 7 digits and the 1,414th triangular number •
1,002,001 = 10012, palindromic square •
1,006,301 = First number of the first pair of
prime quadruplets occurring thirty apart ({1006301, 1006303, 1006307, 1006309} and {1006331, 1006333, 1006337, 1006339}) •
1,024,000 = Sometimes, the number of bytes in a
megabyte •
1,030,301 = 1013, palindromic cube •
1,037,718 =
Large Schröder number •
1,048,576 = 10242 = 324 = 165 = 410 = 220, the number of
bytes in a
mebibyte (previously called a megabyte) •
1,048,976 = smallest 7 digit Leyland number •
1,058,576 =
Leyland number •
1,058,841 = 76 x 32 •
1,077,871 = the amount of
prime numbers between 0 and 16777216(2^24) •
1,081,080 = 39th
highly composite number •
1,084,051 = fifth
Keith prime •
1,089,270 =
harmonic divisor number •
1,111,111 =
repunit •
1,112,083 = logarithmic number •
1,129,30832 + 1 is prime •
1,136,689 =
Pell number,
Markov number •
1,174,281 = Fine number •
1,185,921 = 10892 = 334 •
1,200,304 = 17 + 27 + 37 + 47 + 57 + 67 + 77 •
1,203,623 = smallest unprimeable number ending in 3 •
1,234,321 = 11112, palindromic square •
1,246,863 = Number of 27-bead necklaces (turning over is allowed) where complements are equivalent •
1,256,070 = number of reduced trees with 29 nodes •
1,262,180 = number of triangle-free graphs on 12 vertices •
1,278,818 = Markov number •
1,296,000 = number of primitive polynomials of degree 25 over GF(2) •
1,299,709 = 100,000th
prime number •
1,336,336 = 11562 = 344 •
1,346,269 =
Fibonacci number, Markov number •
1,419,857 = 175 •
1,421,280 = harmonic divisor number 11th
superior highly composite number, 40th
highly composite number •
1,594,323 = 313 •
1,596,520 = Leyland number •
1,606,137 = number of ways to partition {1,2,3,4,5,6,7,8,9} and then partition each cell (block) into subcells. •
1,607,521/1,136,689 ≈
√2 •
1,647,086 = Leyland number •
1,671,800 = Initial number of first century
xx00 to
xx99 consisting entirely of
composite numbers •
1,679,616 = 12962 = 364 = 68 •
1,686,049 = Markov prime •
1,687,989 = number of square (0,1)-matrices without zero rows and with exactly 7 entries equal to 1 •
1,719,900 = number of primitive polynomials of degree 26 over GF(2) •
1,874,161 = 13692 = 374 •
1,889,568 = 185 •
1,928,934 = 2 x 39 x 72 •
1,941,760 =
Leyland number •
1,953,125 = 1253 = 59 •
1,978,405 = 16 + 26 + 36 + 46 + 56 + 66 + 76 + 86 + 96 + 106
2,000,000 to 2,999,999 •
2,000,002 = number of surface-points of a tetrahedron with edge-length 1000 •
2,000,376 = 1263 •
2,012,174 = Leyland number •
2,012,674 = Markov number using 2 & 21 (221 + 212) •
2,118,107 = largest integer n\le10^{10} such that \sum_{k=0}^{22}\omega(n+k)\le57, where \omega(n) is the
prime omega function for distinct
prime factors. The corresponding sum for 2118107 is indeed 57. •
2,124,679 = largest known
Wolstenholme prime •
2,144,505 = number of trees with 21 unlabeled nodes •
2,162,160 = 41st
highly composite number, •
2,178,309 =
Fibonacci number •
2,274,205 = number of different ways of expressing 1,000,000,000 as the sum of two prime numbers •
2,313,441 = 15212 = 394 •
2,356,779 =
Motzkin number •
2,405,236 = Number of 28-bead necklaces (turning over is allowed) where complements are equivalent •
2,598,560 = chances of getting a
royal flush in a hand of
poker (52!/5!47!) (
n choose r) •
2,646,723 =
little Schroeder number •
2,674,440 =
Catalan number •
2,692,537 = Leonardo prime •
2,704,900 = initial number of fourth century
xx00 to
xx99 containing seventeen
prime numbers {2,704,901, 2,704,903, 2,704,907, 2,704,909, 2,704,927, 2,704,931, 2,704,937, 2,704,939, 2,704,943, 2,704,957, 2,704,963, 2,704,969, 2,704,979, 2,704,981, 2,704,987, 2,704,993, 2,704,997} •
2,744,210 = Pell number Jacobsthal prime •
2,825,761 = 16812 = 414 •
2,890,625 = 1-
automorphic number •
2,922,509 = Markov prime •
2,985,984 = 17282 = 1443 = 126 = 1,000,00012 AKA a great-great-gross
3,000,000 to 3,999,999 •
3,111,696 = 17642 = 424 •
3,200,000 = 205 •
3,263,443 = sixth term of
Sylvester's sequence •
3,276,509 = Markov prime •
3,294,172 = 22×77 •
3,301,819 =
alternating factorial •
3,333,333 =
repdigit •
3,360,633 = palindromic in 3 consecutive bases: 62818269 = 336063310 = 199599111 •
3,418,801 = 18492 = 434 •
3,426,576 = number of free 15-ominoes •
3,524,578 = Fibonacci number, •
3,626,149 = Wedderburn–Etherington prime •
4,260,282 = Fine number •
4,324,320 = 12th
colossally abundant number, •
4,785,713 = Leyland number •
4,794,088 = number of 28-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed •
5,134,240 = the largest number that cannot be expressed as the sum of distinct fourth powers •
5,153,632 = 225 •
5,195,977 = smallest number
n such that the sum of reciprocals of primes up to
n exceeds 3 •
5,221,225 = 22852, palindromic square •
5,293,446 =
Large Schröder number •
5,308,416 = 23042 = 484 •
5,496,925 = first
cyclic number in
base 6 •
5,555,555 =
repdigit •
5,623,756 = number of trees with 22 unlabeled nodes •
8,888,888 =
repdigit •
8,946,176 =
self-descriptive number in base 8 •
8,964,800 = Number of 30-bead necklaces (turning over is allowed) where complements are equivalent •
9,647,009 = Markov number •
9,694,845 = Catalan number == See also ==