Base | Representation |
---|---|
bin | 11001000010011101010000… |
… | …00110100100010000110111 |
3 | 21012221200111111021010120212 |
4 | 30201032220012210100313 |
5 | 24204100343022423421 |
6 | 313034115000020035 |
7 | 14411645164323662 |
oct | 1441165006442067 |
9 | 235850444233525 |
10 | 55060006061111 |
11 | 165a88aa012497 |
12 | 6212bb876161b |
13 | 24951a058717c |
14 | d84cc05806d9 |
15 | 6573853cee5b |
hex | 3213a81a4437 |
55060006061111 has 8 divisors (see below), whose sum is σ = 57127643667120. Its totient is φ = 53003636235648.
The previous prime is 55060006060999. The next prime is 55060006061119. The reversal of 55060006061111 is 11116060006055.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-55060006061111 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55060006061119) 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 7 ways as a sum of consecutive naturals, for example, 2816935181 + ... + 2816954726.
It is an arithmetic number, because the mean of its divisors is an integer number (7140955458390).
Almost surely, 255060006061111 is an apocalyptic number.
55060006061111 is a deficient number, since it is larger than the sum of its proper divisors (2067637606009).
55060006061111 is a wasteful number, since it uses less digits than its factorization.
55060006061111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5633890273.
The product of its (nonzero) digits is 5400, while the sum is 32.
Adding to 55060006061111 its reverse (11116060006055), we get a palindrome (66176066067166).
The spelling of 55060006061111 in words is "fifty-five trillion, sixty billion, six million, sixty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •