Base | Representation |
---|---|
bin | 11001000001000000010011… |
… | …00001111001111010001000 |
3 | 21012202220200112002212102121 |
4 | 30200200021201321322020 |
5 | 24202241141324310211 |
6 | 312555142545341024 |
7 | 14405230404355213 |
oct | 1440401141717210 |
9 | 235686615085377 |
10 | 55010101010056 |
11 | 1658971aa00a45 |
12 | 62053ab637774 |
13 | 24905793acb6a |
14 | d827086c877a |
15 | 655e14043271 |
hex | 320809879e88 |
55010101010056 has 32 divisors (see below), whose sum is σ = 105095360948760. Its totient is φ = 26984723863552.
The previous prime is 55010101009973. The next prime is 55010101010101. The reversal of 55010101010056 is 65001010101055.
It can be written as a sum of positive squares in 4 ways, for example, as 30226530553956 + 24783570456100 = 5497866^2 + 4978310^2 .
It is a super-2 number, since 2×550101010100562 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 55010101010056.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5150136 + ... + 11685208.
Almost surely, 255010101010056 is an apocalyptic number.
It is an amenable number.
55010101010056 is a deficient number, since it is larger than the sum of its proper divisors (50085259938704).
55010101010056 is a wasteful number, since it uses less digits than its factorization.
55010101010056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6554985 (or 6554981 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 25.
Subtracting 55010101010056 from its reverse (65001010101055), we obtain a palindrome (9990909090999).
The spelling of 55010101010056 in words is "fifty-five trillion, ten billion, one hundred one million, ten thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •