Base | Representation |
---|---|
bin | 110011101000101110… |
… | …0010111010000101011 |
3 | 101121012222102212222112 |
4 | 1213101130113100223 |
5 | 3304044320241401 |
6 | 122535151512535 |
7 | 11003623631366 |
oct | 1472134272053 |
9 | 347188385875 |
10 | 110888055851 |
11 | 43033464671 |
12 | 195a822874b |
13 | a5c24a0b41 |
14 | 551d1110dd |
15 | 2d400653bb |
hex | 19d171742b |
110888055851 has 2 divisors, whose sum is σ = 110888055852. Its totient is φ = 110888055850.
The previous prime is 110888055763. The next prime is 110888055881. The reversal of 110888055851 is 158550888011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110888055851 - 226 = 110820946987 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110888055851.
It is not a weakly prime, because it can be changed into another prime (110888055881) by changing a digit.
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 as a sum of consecutive naturals, namely, 55444027925 + 55444027926.
It is an arithmetic number, because the mean of its divisors is an integer number (55444027926).
Almost surely, 2110888055851 is an apocalyptic number.
110888055851 is a deficient number, since it is larger than the sum of its proper divisors (1).
110888055851 is an equidigital number, since it uses as much as digits as its factorization.
110888055851 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 512000, while the sum is 50.
The spelling of 110888055851 in words is "one hundred ten billion, eight hundred eighty-eight million, fifty-five thousand, eight hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •