Base | Representation |
---|---|
bin | 11001000001000000001101… |
… | …00011100010001011100111 |
3 | 21012202220120001012110021010 |
4 | 30200200012203202023213 |
5 | 24202241041040334021 |
6 | 312555134003553303 |
7 | 14405226230236005 |
oct | 1440400643421347 |
9 | 235686501173233 |
10 | 55010051105511 |
11 | 165896a4815a17 |
12 | 620539698b833 |
13 | 249056bc59048 |
14 | d82701c17a75 |
15 | 655e0e986976 |
hex | 3208068e22e7 |
55010051105511 has 8 divisors (see below), whose sum is σ = 73874409159040. Its totient is φ = 36409530227832.
The previous prime is 55010051105497. The next prime is 55010051105557. The reversal of 55010051105511 is 11550115001055.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 55010051105511 - 25 = 55010051105479 is a prime.
It is a super-2 number, since 2×550100511055112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55010051105411) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 65959293475 + ... + 65959294308.
It is an arithmetic number, because the mean of its divisors is an integer number (9234301144880).
Almost surely, 255010051105511 is an apocalyptic number.
55010051105511 is a deficient number, since it is larger than the sum of its proper divisors (18864358053529).
55010051105511 is a wasteful number, since it uses less digits than its factorization.
55010051105511 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 131918587925.
The product of its (nonzero) digits is 3125, while the sum is 30.
Adding to 55010051105511 its reverse (11550115001055), we get a palindrome (66560166106566).
The spelling of 55010051105511 in words is "fifty-five trillion, ten billion, fifty-one million, one hundred five thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •