Base | Representation |
---|---|
bin | 10000010011010010011… |
… | …011110011001111101111 |
3 | 10222002111012022210212211 |
4 | 100103102123303033233 |
5 | 121323203313000421 |
6 | 2214342313111251 |
7 | 143635100615044 |
oct | 20232233631757 |
9 | 3862435283784 |
10 | 1120222000111 |
11 | 3a20a1129a85 |
12 | 1611340b8527 |
13 | 81837470b06 |
14 | 3c30d05b1cb |
15 | 1e215e6e9e1 |
hex | 104d26f33ef |
1120222000111 has 2 divisors, whose sum is σ = 1120222000112. Its totient is φ = 1120222000110.
The previous prime is 1120222000069. The next prime is 1120222000151. The reversal of 1120222000111 is 1110002220211.
It is a strong prime.
It is an emirp because it is prime and its reverse (1110002220211) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1120222000111 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1120222000091 and 1120222000100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1120222000151) 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, 560111000055 + 560111000056.
It is an arithmetic number, because the mean of its divisors is an integer number (560111000056).
Almost surely, 21120222000111 is an apocalyptic number.
1120222000111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1120222000111 is an equidigital number, since it uses as much as digits as its factorization.
1120222000111 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 13.
Adding to 1120222000111 its reverse (1110002220211), we get a palindrome (2230224220322).
The spelling of 1120222000111 in words is "one trillion, one hundred twenty billion, two hundred twenty-two million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •