Base | Representation |
---|---|
bin | 11001100001000010000011… |
… | …011001011101111000111011 |
3 | 112201100020022002212111020021 |
4 | 121201002003121131320323 |
5 | 104202112313130014321 |
6 | 1034401355523311311 |
7 | 32431464502154641 |
oct | 3141020331357073 |
9 | 481306262774207 |
10 | 112221110001211 |
11 | 32836783aa7572 |
12 | 1070525281b537 |
13 | 4a805364a2573 |
14 | 1d9d76037b191 |
15 | ce91de08e941 |
hex | 66108365de3b |
112221110001211 has 2 divisors, whose sum is σ = 112221110001212. Its totient is φ = 112221110001210.
The previous prime is 112221110001167. The next prime is 112221110001227. The reversal of 112221110001211 is 112100011122211.
It is an a-pointer prime, because the next prime (112221110001227) can be obtained adding 112221110001211 to its sum of digits (16).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 112221110001211 - 223 = 112221101612603 is a prime.
It is not a weakly prime, because it can be changed into another prime (112221710001211) 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, 56110555000605 + 56110555000606.
It is an arithmetic number, because the mean of its divisors is an integer number (56110555000606).
Almost surely, 2112221110001211 is an apocalyptic number.
112221110001211 is a deficient number, since it is larger than the sum of its proper divisors (1).
112221110001211 is an equidigital number, since it uses as much as digits as its factorization.
112221110001211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 112221110001211 its reverse (112100011122211), we get a palindrome (224321121123422).
The spelling of 112221110001211 in words is "one hundred twelve trillion, two hundred twenty-one billion, one hundred ten million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •