Base | Representation |
---|---|
bin | 11110000001000000110100… |
… | …11000110010010100011110 |
3 | 22122201001201210100121112022 |
4 | 33000200122120302110132 |
5 | 32122413231012010420 |
6 | 352214301431540142 |
7 | 16621511552550221 |
oct | 1700403230622436 |
9 | 278631653317468 |
10 | 66005500110110 |
11 | 1a038859063700 |
12 | 74a038452a652 |
13 | 2aaa3a45600c2 |
14 | 124297cbab5b8 |
15 | 796e4b82cc25 |
hex | 3c081a63251e |
66005500110110 has 48 divisors (see below), whose sum is σ = 130632197916528. Its totient is φ = 23994740647680.
The previous prime is 66005500110107. The next prime is 66005500110119. The reversal of 66005500110110 is 1101100550066.
It is a self number, because there is not a number n which added to its sum of digits gives 66005500110110.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66005500110119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4246187 + ... + 12249126.
It is an arithmetic number, because the mean of its divisors is an integer number (2721504123261).
Almost surely, 266005500110110 is an apocalyptic number.
66005500110110 is a deficient number, since it is larger than the sum of its proper divisors (64626697806418).
66005500110110 is a wasteful number, since it uses less digits than its factorization.
66005500110110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16498649 (or 16498638 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 26.
Adding to 66005500110110 its reverse (1101100550066), we get a palindrome (67106600660176).
The spelling of 66005500110110 in words is "sixty-six trillion, five billion, five hundred million, one hundred ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •