Base | Representation |
---|---|
bin | 1001001100100000100100… |
… | …0111101000010111000111 |
3 | 1022210112222112210012111121 |
4 | 2103020021013220113013 |
5 | 2311122304014310210 |
6 | 33300411412214411 |
7 | 2062313523052603 |
oct | 223101107502707 |
9 | 38715875705447 |
10 | 10110506010055 |
11 | 3248929075a60 |
12 | 117359800a407 |
13 | 584555432c59 |
14 | 26d4cb5d0503 |
15 | 127ee668e6da |
hex | 932091e85c7 |
10110506010055 has 16 divisors (see below), whose sum is σ = 13459903228800. Its totient is φ = 7228466544160.
The previous prime is 10110506010049. The next prime is 10110506010061. The reversal of 10110506010055 is 55001060501101.
It is an interprime number because it is at equal distance from previous prime (10110506010049) and next prime (10110506010061).
It is not a de Polignac number, because 10110506010055 - 213 = 10110506001863 is a prime.
It is a super-2 number, since 2×101105060100552 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 1557855925 + ... + 1557862414.
It is an arithmetic number, because the mean of its divisors is an integer number (841243951800).
Almost surely, 210110506010055 is an apocalyptic number.
10110506010055 is a deficient number, since it is larger than the sum of its proper divisors (3349397218745).
10110506010055 is a wasteful number, since it uses less digits than its factorization.
10110506010055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3115718414.
The product of its (nonzero) digits is 750, while the sum is 25.
Adding to 10110506010055 its reverse (55001060501101), we get a palindrome (65111566511156).
The spelling of 10110506010055 in words is "ten trillion, one hundred ten billion, five hundred six million, ten thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •