Base | Representation |
---|---|
bin | 110011010010001110… |
… | …0111001111100111111 |
3 | 101112021101002102021211 |
4 | 1212210130321330333 |
5 | 3301023101120411 |
6 | 122332225105251 |
7 | 10646126644243 |
oct | 1464434717477 |
9 | 345241072254 |
10 | 110133223231 |
11 | 42786373759 |
12 | 19417488227 |
13 | a501ca3815 |
14 | 548ab82423 |
15 | 2ce8b61221 |
hex | 19a4739f3f |
110133223231 has 2 divisors, whose sum is σ = 110133223232. Its totient is φ = 110133223230.
The previous prime is 110133223223. The next prime is 110133223241. The reversal of 110133223231 is 132322331011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110133223231 - 23 = 110133223223 is a prime.
It is a super-2 number, since 2×1101332232312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110133223241) 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, 55066611615 + 55066611616.
It is an arithmetic number, because the mean of its divisors is an integer number (55066611616).
Almost surely, 2110133223231 is an apocalyptic number.
110133223231 is a deficient number, since it is larger than the sum of its proper divisors (1).
110133223231 is an equidigital number, since it uses as much as digits as its factorization.
110133223231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 110133223231 its reverse (132322331011), we get a palindrome (242455554242).
The spelling of 110133223231 in words is "one hundred ten billion, one hundred thirty-three million, two hundred twenty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •