Base | Representation |
---|---|
bin | 10100100000100011… |
… | …011111101010011001 |
3 | 2002211200102022200112 |
4 | 110200203133222121 |
5 | 330044334341441 |
6 | 14041042414105 |
7 | 1406462341343 |
oct | 244043375231 |
9 | 62750368615 |
10 | 22021012121 |
11 | 9380318379 |
12 | 4326961335 |
13 | 20cc2cacb4 |
14 | 10cc890293 |
15 | 88d3ce4eb |
hex | 5208dfa99 |
22021012121 has 2 divisors, whose sum is σ = 22021012122. Its totient is φ = 22021012120.
The previous prime is 22021012109. The next prime is 22021012127. The reversal of 22021012121 is 12121012022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 22009206025 + 11806096 = 148355^2 + 3436^2 .
It is a cyclic number.
It is not a de Polignac number, because 22021012121 - 230 = 20947270297 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22021012096 and 22021012105.
It is not a weakly prime, because it can be changed into another prime (22021012127) 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, 11010506060 + 11010506061.
It is an arithmetic number, because the mean of its divisors is an integer number (11010506061).
Almost surely, 222021012121 is an apocalyptic number.
It is an amenable number.
22021012121 is a deficient number, since it is larger than the sum of its proper divisors (1).
22021012121 is an equidigital number, since it uses as much as digits as its factorization.
22021012121 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 14.
Adding to 22021012121 its reverse (12121012022), we get a palindrome (34142024143).
Subtracting from 22021012121 its reverse (12121012022), we obtain a palindrome (9900000099).
The spelling of 22021012121 in words is "twenty-two billion, twenty-one million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •