Base | Representation |
---|---|
bin | 10011000010100100… |
… | …10000100110000111 |
3 | 222101101201001021211 |
4 | 21201102100212013 |
5 | 131413330023421 |
6 | 4410155152251 |
7 | 511212340132 |
oct | 114122204607 |
9 | 28341631254 |
10 | 10222111111 |
11 | 437612a413 |
12 | 1b93445687 |
13 | c6ba16a74 |
14 | 6cd85d219 |
15 | 3ec6339e1 |
hex | 261490987 |
10222111111 has 2 divisors, whose sum is σ = 10222111112. Its totient is φ = 10222111110.
The previous prime is 10222111079. The next prime is 10222111117. The reversal of 10222111111 is 11111122201.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10222111111 - 25 = 10222111079 is a prime.
10222111111 is a modest number, since divided by 111111 gives 10222 as remainder.
It is a junction number, because it is equal to n+sod(n) for n = 10222111091 and 10222111100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10222111117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5111055555 + 5111055556.
It is an arithmetic number, because the mean of its divisors is an integer number (5111055556).
Almost surely, 210222111111 is an apocalyptic number.
10222111111 is a deficient number, since it is larger than the sum of its proper divisors (1).
10222111111 is an equidigital number, since it uses as much as digits as its factorization.
10222111111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10222111111 its reverse (11111122201), we get a palindrome (21333233312).
The spelling of 10222111111 in words is "ten billion, two hundred twenty-two million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •