Base | Representation |
---|---|
bin | 11110010001001000001001… |
… | …01011010110110011101110 |
3 | 22201122222220011021122221100 |
4 | 33020210010223112303232 |
5 | 32211001203241114330 |
6 | 353320511312143530 |
7 | 20006512456562121 |
oct | 1710440453266356 |
9 | 281588804248840 |
10 | 66559186660590 |
11 | 1a231657748088 |
12 | 756b748b37ba6 |
13 | 2b1a6731427c0 |
14 | 12616a61a03b8 |
15 | 7a65557b2060 |
hex | 3c8904ad6cee |
66559186660590 has 96 divisors (see below), whose sum is σ = 186409188725760. Its totient is φ = 16379978600448.
The previous prime is 66559186660553. The next prime is 66559186660591. The reversal of 66559186660590 is 9506668195566.
66559186660590 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66559186660591) 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 47 ways as a sum of consecutive naturals, for example, 1613742 + ... + 11650001.
It is an arithmetic number, because the mean of its divisors is an integer number (1941762382560).
Almost surely, 266559186660590 is an apocalyptic number.
66559186660590 is an abundant number, since it is smaller than the sum of its proper divisors (119850002065170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66559186660590 is a wasteful number, since it uses less digits than its factorization.
66559186660590 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13268058 (or 13268055 counting only the distinct ones).
The product of its (nonzero) digits is 629856000, while the sum is 72.
The spelling of 66559186660590 in words is "sixty-six trillion, five hundred fifty-nine billion, one hundred eighty-six million, six hundred sixty thousand, five hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •