Base | Representation |
---|---|
bin | 111101100000111101… |
… | …000001011100000000 |
3 | 20022111012211111022010 |
4 | 331200331001130000 |
5 | 2040233041300343 |
6 | 50202104412520 |
7 | 4525544150421 |
oct | 754075013400 |
9 | 208435744263 |
10 | 66051118848 |
11 | 26015153230 |
12 | 10974477140 |
13 | 62c82b36a0 |
14 | 32a83ab648 |
15 | 1ab8ad6d33 |
hex | f60f41700 |
66051118848 has 576 divisors, whose sum is σ = 218891796480. Its totient is φ = 17396121600.
The previous prime is 66051118829. The next prime is 66051118849. The reversal of 66051118848 is 84881115066.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a junction number, because it is equal to n+sod(n) for n = 66051118797 and 66051118806.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66051118849) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 199550043 + ... + 199550373.
It is an arithmetic number, because the mean of its divisors is an integer number (380020480).
Almost surely, 266051118848 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 66051118848, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (109445898240).
66051118848 is an abundant number, since it is smaller than the sum of its proper divisors (152840677632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66051118848 is a wasteful number, since it uses less digits than its factorization.
66051118848 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 476 (or 462 counting only the distinct ones).
The product of its (nonzero) digits is 368640, while the sum is 48.
The spelling of 66051118848 in words is "sixty-six billion, fifty-one million, one hundred eighteen thousand, eight hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •