Base | Representation |
---|---|
bin | 1001010011000000010010… |
… | …1000111111101111101001 |
3 | 1100012020000201121021201111 |
4 | 2110300010220333233221 |
5 | 2314434330101121301 |
6 | 33423545023150321 |
7 | 2103344111355136 |
oct | 224600450775751 |
9 | 40166021537644 |
10 | 10222100020201 |
11 | 3291193a76523 |
12 | 11911407453a1 |
13 | 591c2ac49414 |
14 | 274a7638958d |
15 | 12ad786a1551 |
hex | 94c04a3fbe9 |
10222100020201 has 2 divisors, whose sum is σ = 10222100020202. Its totient is φ = 10222100020200.
The previous prime is 10222100020063. The next prime is 10222100020211. The reversal of 10222100020201 is 10202000122201.
It is a happy number.
10222100020201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9779229734976 + 442870285225 = 3127176^2 + 665485^2 .
It is a cyclic number.
It is not a de Polignac number, because 10222100020201 - 213 = 10222100012009 is a prime.
It is not a weakly prime, because it can be changed into another prime (10222100020211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5111050010100 + 5111050010101.
It is an arithmetic number, because the mean of its divisors is an integer number (5111050010101).
Almost surely, 210222100020201 is an apocalyptic number.
It is an amenable number.
10222100020201 is a deficient number, since it is larger than the sum of its proper divisors (1).
10222100020201 is an equidigital number, since it uses as much as digits as its factorization.
10222100020201 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 10222100020201 its reverse (10202000122201), we get a palindrome (20424100142402).
The spelling of 10222100020201 in words is "ten trillion, two hundred twenty-two billion, one hundred million, twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •