Base | Representation |
---|---|
bin | 111101100110101010… |
… | …110110111101110010 |
3 | 20022201220021210212000 |
4 | 331212222312331302 |
5 | 2040432114130113 |
6 | 50215412114430 |
7 | 4531120253505 |
oct | 754652667562 |
9 | 208656253760 |
10 | 66147020658 |
11 | 260642a5724 |
12 | 109a0605a16 |
13 | 6312120a14 |
14 | 32b701313c |
15 | 1ac222c373 |
hex | f66ab6f72 |
66147020658 has 64 divisors (see below), whose sum is σ = 150523422720. Its totient is φ = 21520262736.
The previous prime is 66147020657. The next prime is 66147020669. The reversal of 66147020658 is 85602074166.
66147020658 is a `hidden beast` number, since 6 + 614 + 7 + 0 + 20 + 6 + 5 + 8 = 666.
It is not an unprimeable number, because it can be changed into a prime (66147020657) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3350091 + ... + 3369777.
It is an arithmetic number, because the mean of its divisors is an integer number (2351928480).
Almost surely, 266147020658 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 66147020658, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (75261711360).
66147020658 is an abundant number, since it is smaller than the sum of its proper divisors (84376402062).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66147020658 is a wasteful number, since it uses less digits than its factorization.
66147020658 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21188 (or 21182 counting only the distinct ones).
The product of its (nonzero) digits is 483840, while the sum is 45.
The spelling of 66147020658 in words is "sixty-six billion, one hundred forty-seven million, twenty thousand, six hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •