60,000
From HandWiki
60,000 (sixty thousand) is the natural number that follows 59,999 and precedes 60,001. It is the value of (75025).[1]
Selected numbers in the range 60,000–69,999
60,001 to 60,999
- 60,049 = Leyland number[2] using 3 & 10 (310 + 103)
- 60,101 = smallest prime with period of reciprocal 100[3]
61,000 to 61,999
- 61,776 = 24 x 33 x 11 x 13 = 15 + 25 + 35 + 45 + 55 + 65 + 75 + 85.[4] It is an untouchable number,[5] a triangular number,[6] hexagonal number,[7] 100-gonal number,[8] and is polygonal in 6 other ways.
62,000 to 62,999
- 62,208 = 3-smooth number
- 62,210 = Markov number[9]
- 62,745 = Carmichael number[10]
63,000 to 63,999
- 63,020 = amicable number with 76084
- 63,261 = number of partitions of 43[11]
- 63,360 = inches in a mile
- 63,600 = number of free 12-ominoes
- 63,750 = pentagonal pyramidal number
- 63,973 = Carmichael number[10]
64,000 to 64,999
- 64,000 = 403
- 64,009 = sum of the cubes of the first 22 positive integers
- 64,079 = Lucas number
- 64,442 = Number of integer degree intersections on Earth: 360 longitudes * 179 latitudes + 2 poles = 64442.
- 64,620 : It is an untouchable number,[5] a triangular number,[6] hexagonal number,[7] and a number such that pi(64620) = 64620/10.[12]
65,000 to 65,999
- 65,025 = 2552, palindromic in base 11 (4494411)
- 65,504 = largest representable value in half-precision floating-point format[13]
- 65,535 = largest value for an unsigned 16-bit integer on a computer.
- 65,536 = 216 = 48 = 164 = 2562 also 2↑↑4=2↑↑↑3 using Knuth's up-arrow notation, smallest integer with exactly 17 divisors, palindromic in base 15 (1464115), number of directed graphs on 4 labeled nodes[14]
- 65,537 = largest known Fermat prime
- 65,539 = the 6544th prime number, and both 6544 and 65539 have digital root of 1; a regular prime; a larger member of a twin prime pair; a smaller member of a cousin prime pair; a happy prime; a weak prime; a middle member of a prime triplet, (65537, 65539, 65543); a middle member of a three-term primes in arithmetic progression, (65521, 65539, 65557).
- 65,792 = Leyland number[2] using 2 & 16 (216 + 162)
66,000 to 66,999
- 66,012 = tribonacci number[15]
- 66,049 = 2572, palindromic in hexadecimal (1020116)
- 66,198 = Giuga number[16]
- 66,666 = repdigit
67,000 to 67,999
- 67,081 = 2592, palindromic in base 6 (12343216)
- 67,171 = 16 + 26 + 36 + 46 + 56 + 66[17]
- 67,607 = largest of five remaining Seventeen or Bust numbers in the Sierpiński problem
- 67,626 = pentagonal pyramidal number
68,000 to 68,999
- 68,906 = number of prime numbers having six digits.[18]
- 68,921 = 413
69,000 to 69,999
- 69,632 = Leyland number[2] using 4 & 8 (48 + 84)
- 69,696 = square of 264; only known palindromic square that can be expressed as the sum of a pair of twin primes: 69,696 = 34847 + 34849.
- 69,984 = 3-smooth number
Primes
There are 878 prime numbers between 60000 and 70000.
References
- ↑ Sloane, N. J. A., ed. "Sequence A065449 (a(n) = phi(Fibonacci(n)))". OEIS Foundation. https://oeis.org/A065449.
- ↑ 2.0 2.1 2.2 Sloane, N. J. A., ed. "Sequence A076980 (Leyland numbers)". OEIS Foundation. https://oeis.org/A076980.
- ↑ Sloane, N. J. A., ed. "Sequence A007138 (Smallest primitive factor of 10^n - 1. Also smallest prime p such that 1/p has repeating decimal expansion of period n)". OEIS Foundation. https://oeis.org/A007138.
- ↑ Sloane, N. J. A., ed. "Sequence A000539 (Sum of 5th powers: 0^5 + 1^5 + 2^5 + ... + n^5)". OEIS Foundation. https://oeis.org/A000539.
- ↑ 5.0 5.1 Sloane, N. J. A., ed. "Sequence A005114 (Untouchable numbers, also called nonaliquot numbers: impossible values for the sum of aliquot parts function)". OEIS Foundation. https://oeis.org/A005114.
- ↑ 6.0 6.1 Sloane, N. J. A., ed. "Sequence A000217 (Triangular numbers: a(n) = binomial(n+1,2) = n*(n+1)/2 = 0 + 1 + 2 + ... + n)". OEIS Foundation. https://oeis.org/A000217.
- ↑ 7.0 7.1 Sloane, N. J. A., ed. "Sequence A000384 (Hexagonal numbers: a(n) = n*(2*n-1))". OEIS Foundation. https://oeis.org/A000384.
- ↑ Sloane, N. J. A., ed. "Sequence A261276 (100-gonal numbers: a(n) = 98*n*(n-1)/2 + n)". OEIS Foundation. https://oeis.org/A261276.
- ↑ Sloane, N. J. A., ed. "Sequence A002559 (Markoff (or Markov) numbers)". OEIS Foundation. https://oeis.org/A002559.
- ↑ 10.0 10.1 Sloane, N. J. A., ed. "Sequence A002997 (Carmichael numbers)". OEIS Foundation. https://oeis.org/A002997.
- ↑ Sloane, N. J. A., ed. "Sequence A000041 (a(n) is the number of partitions of n (the partition numbers))". OEIS Foundation. https://oeis.org/A000041.
- ↑ Sloane, N. J. A., ed. "Sequence A165689 (Numbers n such that pi(n) = (1/10)*n)". OEIS Foundation. https://oeis.org/A165689.
- ↑ IEEE Standard for Floating-Point Arithmetic. IEEE STD 754-2019 (Revision of IEEE 754-2008). July 2019. pp. 1–84. doi:10.1109/ieeestd.2019.8766229. ISBN 978-1-5044-5924-2.
- ↑ Sloane, N. J. A., ed. "Sequence A002416 (a(n) = 2^(n^2))". OEIS Foundation. https://oeis.org/A002416.
- ↑ Sloane, N. J. A., ed. "Sequence A000073 (Tribonacci numbers)". OEIS Foundation. https://oeis.org/A000073.
- ↑ Sloane, N. J. A., ed. "Sequence A007850 (Giuga numbers)". OEIS Foundation. https://oeis.org/A007850.
- ↑ Sloane, N. J. A., ed. "Sequence A031971 (a(n) = Sum_{k=1..n} k^n)". OEIS Foundation. https://oeis.org/A031971.
- ↑ Sloane, N. J. A., ed. "Sequence A006879 (Number of primes with n digits.)". OEIS Foundation. https://oeis.org/A006879.
 |  |
