Base | Representation |
---|---|
bin | 10011101010111110… |
… | …011011001111000101 |
3 | 2000112000221222002222 |
4 | 103222332123033011 |
5 | 321224224232323 |
6 | 13411531542125 |
7 | 1345265622632 |
oct | 235276331705 |
9 | 60460858088 |
10 | 21122102213 |
11 | 8a59970023 |
12 | 41158ba945 |
13 | 1cb7cc6844 |
14 | 1045339189 |
15 | 83951a9c8 |
hex | 4eaf9b3c5 |
21122102213 has 2 divisors, whose sum is σ = 21122102214. Its totient is φ = 21122102212.
The previous prime is 21122102189. The next prime is 21122102263. The reversal of 21122102213 is 31220122112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11771599009 + 9350503204 = 108497^2 + 96698^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21122102213 is a prime.
It is a super-2 number, since 2×211221022132 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 21122102191 and 21122102200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21122102263) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10561051106 + 10561051107.
It is an arithmetic number, because the mean of its divisors is an integer number (10561051107).
Almost surely, 221122102213 is an apocalyptic number.
It is an amenable number.
21122102213 is a deficient number, since it is larger than the sum of its proper divisors (1).
21122102213 is an equidigital number, since it uses as much as digits as its factorization.
21122102213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 21122102213 its reverse (31220122112), we get a palindrome (52342224325).
The spelling of 21122102213 in words is "twenty-one billion, one hundred twenty-two million, one hundred two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •