Base | Representation |
---|---|
bin | 10011000010100101… |
… | …01110010110110011 |
3 | 222101101221020111122 |
4 | 21201102232112303 |
5 | 131413342424021 |
6 | 4410201532455 |
7 | 511213355414 |
oct | 114122562663 |
9 | 28341836448 |
10 | 10222233011 |
11 | 4376202a61 |
12 | 1b934a412b |
13 | c6ba5a3b3 |
14 | 6cd89180b |
15 | 3ec659bab |
hex | 2614ae5b3 |
10222233011 has 2 divisors, whose sum is σ = 10222233012. Its totient is φ = 10222233010.
The previous prime is 10222232987. The next prime is 10222233029. The reversal of 10222233011 is 11033222201.
10222233011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (11033222201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10222233011 - 218 = 10221970867 is a prime.
It is a super-2 number, since 2×102222330112 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10222233041) 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, 5111116505 + 5111116506.
It is an arithmetic number, because the mean of its divisors is an integer number (5111116506).
Almost surely, 210222233011 is an apocalyptic number.
10222233011 is a deficient number, since it is larger than the sum of its proper divisors (1).
10222233011 is an equidigital number, since it uses as much as digits as its factorization.
10222233011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 10222233011 its reverse (11033222201), we get a palindrome (21255455212).
The spelling of 10222233011 in words is "ten billion, two hundred twenty-two million, two hundred thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •