Base | Representation |
---|---|
bin | 110100001111110110… |
… | …100111100110111011 |
3 | 12100210202002021110212 |
4 | 310033312213212323 |
5 | 1404343220113344 |
6 | 41434445301335 |
7 | 4024136550005 |
oct | 641766474673 |
9 | 170722067425 |
10 | 56100551099 |
11 | 2187933141a |
12 | aa57b6484b |
13 | 53a0913088 |
14 | 2a02a35375 |
15 | 16d524079e |
hex | d0fda79bb |
56100551099 has 2 divisors, whose sum is σ = 56100551100. Its totient is φ = 56100551098.
The previous prime is 56100551071. The next prime is 56100551137. The reversal of 56100551099 is 99015500165.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 56100551099 - 28 = 56100550843 is a prime.
It is a super-2 number, since 2×561005510992 (a number of 22 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (56100551399) 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 as a sum of consecutive naturals, namely, 28050275549 + 28050275550.
It is an arithmetic number, because the mean of its divisors is an integer number (28050275550).
Almost surely, 256100551099 is an apocalyptic number.
56100551099 is a deficient number, since it is larger than the sum of its proper divisors (1).
56100551099 is an equidigital number, since it uses as much as digits as its factorization.
56100551099 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60750, while the sum is 41.
The spelling of 56100551099 in words is "fifty-six billion, one hundred million, five hundred fifty-one thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •