Base | Representation |
---|---|
bin | 111110000100111001… |
… | …010001000100000000 |
3 | 20101001020110211012200 |
4 | 332010321101010000 |
5 | 2043001423122143 |
6 | 50342004553200 |
7 | 4546515423054 |
oct | 760471210400 |
9 | 211036424180 |
10 | 66654114048 |
11 | 262a4567475 |
12 | 10b023b2800 |
13 | 63931ba692 |
14 | 33244d3c64 |
15 | 1b019e71d3 |
hex | f84e51100 |
66654114048 has 216 divisors, whose sum is σ = 194077211328. Its totient is φ = 22000152576.
The previous prime is 66654114019. The next prime is 66654114049. The reversal of 66654114048 is 84041145666.
It is a junction number, because it is equal to n+sod(n) for n = 66654113994 and 66654114012.
It is not an unprimeable number, because it can be changed into a prime (66654114049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 192086611 + ... + 192086957.
It is an arithmetic number, because the mean of its divisors is an integer number (898505608).
Almost surely, 266654114048 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 66654114048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (97038605664).
66654114048 is an abundant number, since it is smaller than the sum of its proper divisors (127423097280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66654114048 is a wasteful number, since it uses less digits than its factorization.
66654114048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 949 (or 932 counting only the distinct ones).
The product of its (nonzero) digits is 552960, while the sum is 45.
The spelling of 66654114048 in words is "sixty-six billion, six hundred fifty-four million, one hundred fourteen thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.181 sec. • engine limits •