Base | Representation |
---|---|
bin | 1001010010111111111010… |
… | …1011100001111000011101 |
3 | 1100012012202202102210122011 |
4 | 2110233332223201320131 |
5 | 2314434124001133041 |
6 | 33423531051551221 |
7 | 2103341455365265 |
oct | 224577653417035 |
9 | 40165682383564 |
10 | 10222000021021 |
11 | 3291142585678 |
12 | 119111315b511 |
13 | 591c133060c9 |
14 | 274a66d987a5 |
15 | 12ad6e9ebe81 |
hex | 94bfeae1e1d |
10222000021021 has 2 divisors, whose sum is σ = 10222000021022. Its totient is φ = 10222000021020.
The previous prime is 10222000020959. The next prime is 10222000021061. The reversal of 10222000021021 is 12012000022201.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10105214476900 + 116785544121 = 3178870^2 + 341739^2 .
It is a cyclic number.
It is not a de Polignac number, because 10222000021021 - 27 = 10222000020893 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10222000020992 and 10222000021010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10222000021061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5111000010510 + 5111000010511.
It is an arithmetic number, because the mean of its divisors is an integer number (5111000010511).
Almost surely, 210222000021021 is an apocalyptic number.
It is an amenable number.
10222000021021 is a deficient number, since it is larger than the sum of its proper divisors (1).
10222000021021 is an equidigital number, since it uses as much as digits as its factorization.
10222000021021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 10222000021021 its reverse (12012000022201), we get a palindrome (22234000043222).
The spelling of 10222000021021 in words is "ten trillion, two hundred twenty-two billion, twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •