Base | Representation |
---|---|
bin | 1001100110101101010101… |
… | …10100010000111111001111 |
3 | 2202210011120010202002111111 |
4 | 10303112222310100333033 |
5 | 10232022224311202343 |
6 | 112530542102232451 |
7 | 4306646343662266 |
oct | 463265264207717 |
9 | 82704503662444 |
10 | 21121220022223 |
11 | 6803506089882 |
12 | 2451525a25727 |
13 | ba295144b679 |
14 | 5303b5a6d5dd |
15 | 269628745c9d |
hex | 1335aad10fcf |
21121220022223 has 2 divisors, whose sum is σ = 21121220022224. Its totient is φ = 21121220022222.
The previous prime is 21121220022163. The next prime is 21121220022257. The reversal of 21121220022223 is 32222002212112.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21121220022223 is a prime.
It is a super-2 number, since 2×211212200222232 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21121220022194 and 21121220022203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21121220022323) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10560610011111 + 10560610011112.
It is an arithmetic number, because the mean of its divisors is an integer number (10560610011112).
Almost surely, 221121220022223 is an apocalyptic number.
21121220022223 is a deficient number, since it is larger than the sum of its proper divisors (1).
21121220022223 is an equidigital number, since it uses as much as digits as its factorization.
21121220022223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 21121220022223 its reverse (32222002212112), we get a palindrome (53343222234335).
The spelling of 21121220022223 in words is "twenty-one trillion, one hundred twenty-one billion, two hundred twenty million, twenty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •