Base | Representation |
---|---|
bin | 110011011110110011… |
… | …1110000111001110011 |
3 | 101120100210200022022121 |
4 | 1212331213300321303 |
5 | 3302404202001042 |
6 | 122442152015111 |
7 | 10662445150261 |
oct | 1467547607163 |
9 | 346323608277 |
10 | 110555500147 |
11 | 42982774644 |
12 | 19514991497 |
13 | a56b614a11 |
14 | 54caca5431 |
15 | 2d20c75367 |
hex | 19bd9f0e73 |
110555500147 has 2 divisors, whose sum is σ = 110555500148. Its totient is φ = 110555500146.
The previous prime is 110555500129. The next prime is 110555500163. The reversal of 110555500147 is 741005555011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110555500147 - 219 = 110554975859 is a prime.
It is a super-2 number, since 2×1105555001472 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (110555500117) 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, 55277750073 + 55277750074.
It is an arithmetic number, because the mean of its divisors is an integer number (55277750074).
Almost surely, 2110555500147 is an apocalyptic number.
110555500147 is a deficient number, since it is larger than the sum of its proper divisors (1).
110555500147 is an equidigital number, since it uses as much as digits as its factorization.
110555500147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17500, while the sum is 34.
The spelling of 110555500147 in words is "one hundred ten billion, five hundred fifty-five million, five hundred thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •