Base | Representation |
---|---|
bin | 1001010010111101000001… |
… | …0000101001011010000101 |
3 | 1100012010202110222201020202 |
4 | 2110233100100221122011 |
5 | 2314431030113101041 |
6 | 33423321511340245 |
7 | 2103313250612255 |
oct | 224572020513205 |
9 | 40163673881222 |
10 | 10221221222021 |
11 | 3290882a05437 |
12 | 1190b36381685 |
13 | 591b1ab671b4 |
14 | 2749d178b965 |
15 | 12ad26461a9b |
hex | 94bd0429685 |
10221221222021 has 2 divisors, whose sum is σ = 10221221222022. Its totient is φ = 10221221222020.
The previous prime is 10221221221973. The next prime is 10221221222081. The reversal of 10221221222021 is 12022212212201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9392600620225 + 828620601796 = 3064735^2 + 910286^2 .
It is a cyclic number.
It is not a de Polignac number, because 10221221222021 - 26 = 10221221221957 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10221221221984 and 10221221222002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10221221222081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5110610611010 + 5110610611011.
It is an arithmetic number, because the mean of its divisors is an integer number (5110610611011).
Almost surely, 210221221222021 is an apocalyptic number.
It is an amenable number.
10221221222021 is a deficient number, since it is larger than the sum of its proper divisors (1).
10221221222021 is an equidigital number, since it uses as much as digits as its factorization.
10221221222021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 10221221222021 its reverse (12022212212201), we get a palindrome (22243433434222).
The spelling of 10221221222021 in words is "ten trillion, two hundred twenty-one billion, two hundred twenty-one million, two hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •