Base | Representation |
---|---|
bin | 11001000010010100111010… |
… | …10101101001111110100010 |
3 | 21012221020221120201001221022 |
4 | 30201022131111221332202 |
5 | 24204012211302000002 |
6 | 313032054521125442 |
7 | 14411426240560604 |
oct | 1441123525517642 |
9 | 235836846631838 |
10 | 55055530500002 |
11 | 165a6a1274415a |
12 | 6212169929882 |
13 | 2494939289366 |
14 | d849b7dd7174 |
15 | 6571c251cba2 |
hex | 32129d569fa2 |
55055530500002 has 8 divisors (see below), whose sum is σ = 83137546057500. Its totient is φ = 27343015147504.
The previous prime is 55055530500001. The next prime is 55055530500011. The reversal of 55055530500002 is 20000503555055.
55055530500002 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 55055524443481 + 6056521 = 7419941^2 + 2461^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×550555305000022 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (55055530500001) 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 3 ways as a sum of consecutive naturals, for example, 92375050877 + ... + 92375051472.
Almost surely, 255055530500002 is an apocalyptic number.
55055530500002 is a deficient number, since it is larger than the sum of its proper divisors (28082015557498).
55055530500002 is a wasteful number, since it uses less digits than its factorization.
55055530500002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 184750102500.
The product of its (nonzero) digits is 93750, while the sum is 35.
The spelling of 55055530500002 in words is "fifty-five trillion, fifty-five billion, five hundred thirty million, five hundred thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •