Base | Representation |
---|---|
bin | 111101110110010001… |
… | …001000100110011000 |
3 | 20100102010201010201011 |
4 | 331312101020212120 |
5 | 2042001112300400 |
6 | 50301401103304 |
7 | 4540445512666 |
oct | 756621104630 |
9 | 210363633634 |
10 | 66408712600 |
11 | 26188a9475a |
12 | 10a54187b34 |
13 | 63543c8119 |
14 | 32dda93c36 |
15 | 1ada1c08ba |
hex | f76448998 |
66408712600 has 192 divisors, whose sum is σ = 166042944000. Its totient is φ = 24625036800.
The previous prime is 66408712561. The next prime is 66408712609. The reversal of 66408712600 is 621780466.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66408712609) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 60757654 + ... + 60758746.
It is an arithmetic number, because the mean of its divisors is an integer number (864807000).
Almost surely, 266408712600 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 66408712600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (83021472000).
66408712600 is an abundant number, since it is smaller than the sum of its proper divisors (99634231400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66408712600 is a wasteful number, since it uses less digits than its factorization.
66408712600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1458 (or 1449 counting only the distinct ones).
The product of its (nonzero) digits is 96768, while the sum is 40.
The spelling of 66408712600 in words is "sixty-six billion, four hundred eight million, seven hundred twelve thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •