Base | Representation |
---|---|
bin | 10011101010111110… |
… | …100010100100001001 |
3 | 2000112001000111021211 |
4 | 103222332202210021 |
5 | 321224231212413 |
6 | 13411532333121 |
7 | 1345266106306 |
oct | 235276424411 |
9 | 60461014254 |
10 | 21122132233 |
11 | 8a59990634 |
12 | 41159141a1 |
13 | 1cb80073c7 |
14 | 10453460ad |
15 | 83952483d |
hex | 4eafa2909 |
21122132233 has 2 divisors, whose sum is σ = 21122132234. Its totient is φ = 21122132232.
The previous prime is 21122132231. The next prime is 21122132327. The reversal of 21122132233 is 33223122112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11108527609 + 10013604624 = 105397^2 + 100068^2 .
It is a cyclic number.
It is not a de Polignac number, because 21122132233 - 21 = 21122132231 is a prime.
It is a super-2 number, since 2×211221322332 (a number of 21 digits) contains 22 as substring.
Together with 21122132231, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (21122132231) 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, 10561066116 + 10561066117.
It is an arithmetic number, because the mean of its divisors is an integer number (10561066117).
Almost surely, 221122132233 is an apocalyptic number.
It is an amenable number.
21122132233 is a deficient number, since it is larger than the sum of its proper divisors (1).
21122132233 is an equidigital number, since it uses as much as digits as its factorization.
21122132233 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 864, while the sum is 22.
Adding to 21122132233 its reverse (33223122112), we get a palindrome (54345254345).
The spelling of 21122132233 in words is "twenty-one billion, one hundred twenty-two million, one hundred thirty-two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •