Base | Representation |
---|---|
bin | 110011010100100011… |
… | …000000111001010111 |
3 | 12021020101211021212120 |
4 | 303110203000321113 |
5 | 1400324010243210 |
6 | 41152023151023 |
7 | 3660365332554 |
oct | 632443007127 |
9 | 167211737776 |
10 | 55105556055 |
11 | 21408716970 |
12 | a81a8a5473 |
13 | 5272739004 |
14 | 294a82ba2b |
15 | 1677bec270 |
hex | cd48c0e57 |
55105556055 has 16 divisors (see below), whose sum is σ = 96184243584. Its totient is φ = 26717845280.
The previous prime is 55105556053. The next prime is 55105556057. The reversal of 55105556055 is 55065550155.
It is an interprime number because it is at equal distance from previous prime (55105556053) and next prime (55105556057).
It is not a de Polignac number, because 55105556055 - 21 = 55105556053 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 55105555998 and 55105556016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55105556053) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 166986369 + ... + 166986698.
It is an arithmetic number, because the mean of its divisors is an integer number (6011515224).
Almost surely, 255105556055 is an apocalyptic number.
55105556055 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
55105556055 is a deficient number, since it is larger than the sum of its proper divisors (41078687529).
55105556055 is a wasteful number, since it uses less digits than its factorization.
55105556055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 333973086.
The product of its (nonzero) digits is 468750, while the sum is 42.
The spelling of 55105556055 in words is "fifty-five billion, one hundred five million, five hundred fifty-six thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •