Base | Representation |
---|---|
bin | 1010000110000110110000… |
… | …11011001110000111101111 |
3 | 2220121022010200222202121011 |
4 | 11003003120123032013233 |
5 | 10402211121113000421 |
6 | 115114314352450051 |
7 | 4450620145333144 |
oct | 503033033160757 |
9 | 86538120882534 |
10 | 22200022000111 |
11 | 7089a8173602a |
12 | 25a661a549927 |
13 | c505b759ab97 |
14 | 56a6b5ab83cb |
15 | 2877181d14e1 |
hex | 1430d86ce1ef |
22200022000111 has 2 divisors, whose sum is σ = 22200022000112. Its totient is φ = 22200022000110.
The previous prime is 22200022000063. The next prime is 22200022000141. The reversal of 22200022000111 is 11100022000222.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 22200022000111 - 219 = 22200021475823 is a prime.
It is a zygodrome in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 22200022000091 and 22200022000100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22200022000141) 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, 11100011000055 + 11100011000056.
It is an arithmetic number, because the mean of its divisors is an integer number (11100011000056).
Almost surely, 222200022000111 is an apocalyptic number.
22200022000111 is a deficient number, since it is larger than the sum of its proper divisors (1).
22200022000111 is an equidigital number, since it uses as much as digits as its factorization.
22200022000111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 22200022000111 its reverse (11100022000222), we get a palindrome (33300044000333).
The spelling of 22200022000111 in words is "twenty-two trillion, two hundred billion, twenty-two million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •