Base | Representation |
---|---|
bin | 10011000010100101… |
… | …01011001011101011 |
3 | 222101101220120200011 |
4 | 21201102223023223 |
5 | 131413342020021 |
6 | 4410201352351 |
7 | 511213302463 |
oct | 114122531353 |
9 | 28341816604 |
10 | 10222220011 |
11 | 43761a4213 |
12 | 1b934986b7 |
13 | c6ba544c3 |
14 | 6cd88aba3 |
15 | 3ec655de1 |
hex | 2614ab2eb |
10222220011 has 2 divisors, whose sum is σ = 10222220012. Its totient is φ = 10222220010.
The previous prime is 10222220009. The next prime is 10222220017. The reversal of 10222220011 is 11002222201.
It is a happy number.
10222220011 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10222220011 - 21 = 10222220009 is a prime.
Together with 10222220009, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 10222219973 and 10222220000.
It is not a weakly prime, because it can be changed into another prime (10222220017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5111110005 + 5111110006.
It is an arithmetic number, because the mean of its divisors is an integer number (5111110006).
Almost surely, 210222220011 is an apocalyptic number.
10222220011 is a deficient number, since it is larger than the sum of its proper divisors (1).
10222220011 is an equidigital number, since it uses as much as digits as its factorization.
10222220011 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 10222220011 its reverse (11002222201), we get a palindrome (21224442212).
The spelling of 10222220011 in words is "ten billion, two hundred twenty-two million, two hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •