Base | Representation |
---|---|
bin | 110011010100111010… |
… | …0010000110010011111 |
3 | 101112111122110100022211 |
4 | 1212221310100302133 |
5 | 3301214121412114 |
6 | 122345202221251 |
7 | 10651302005035 |
oct | 1465164206237 |
9 | 345448410284 |
10 | 110223232159 |
11 | 428221607a7 |
12 | 19441654827 |
13 | a517829841 |
14 | 5498ad2555 |
15 | 2d019e06c4 |
hex | 19a9d10c9f |
110223232159 has 2 divisors, whose sum is σ = 110223232160. Its totient is φ = 110223232158.
The previous prime is 110223232153. The next prime is 110223232201. The reversal of 110223232159 is 951232322011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110223232159 - 29 = 110223231647 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110223232159.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110223232153) 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, 55111616079 + 55111616080.
It is an arithmetic number, because the mean of its divisors is an integer number (55111616080).
Almost surely, 2110223232159 is an apocalyptic number.
110223232159 is a deficient number, since it is larger than the sum of its proper divisors (1).
110223232159 is an equidigital number, since it uses as much as digits as its factorization.
110223232159 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 31.
The spelling of 110223232159 in words is "one hundred ten billion, two hundred twenty-three million, two hundred thirty-two thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •