Base | Representation |
---|---|
bin | 11001001111100100010111… |
… | …01100110011000011110110 |
3 | 21021112202022021011202121210 |
4 | 30213302023230303003312 |
5 | 24233441001241010011 |
6 | 314021101104222250 |
7 | 14456333652133665 |
oct | 1447621354630366 |
9 | 237482267152553 |
10 | 55510501110006 |
11 | 167619647a2458 |
12 | 628638260a986 |
13 | 24c88053a5867 |
14 | d9ca18adaddc |
15 | 663e4ed596a6 |
hex | 327c8bb330f6 |
55510501110006 has 8 divisors (see below), whose sum is σ = 111021002220024. Its totient is φ = 18503500370000.
The previous prime is 55510501109989. The next prime is 55510501110007. The reversal of 55510501110006 is 60001110501555.
It is a sphenic number, since it is the product of 3 distinct primes.
55510501110006 is an admirable number.
It is a super-3 number, since 3×555105011100063 (a number of 42 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55510501110007) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4625875092495 + ... + 4625875092506.
It is an arithmetic number, because the mean of its divisors is an integer number (13877625277503).
Almost surely, 255510501110006 is an apocalyptic number.
55510501110006 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55510501110006 is a wasteful number, since it uses less digits than its factorization.
55510501110006 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9251750185006.
The product of its (nonzero) digits is 3750, while the sum is 30.
The spelling of 55510501110006 in words is "fifty-five trillion, five hundred ten billion, five hundred one million, one hundred ten thousand, six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •