Base | Representation |
---|---|
bin | 1001010010111100111100… |
… | …0111010100100011001001 |
3 | 1100012010201010211010200202 |
4 | 2110233033013110203021 |
5 | 2314431010203000243 |
6 | 33423315543341545 |
7 | 2103312625333511 |
oct | 224571707244311 |
9 | 40163633733622 |
10 | 10221202000073 |
11 | 3290873076729 |
12 | 1190b2ba518b5 |
13 | 591b16b96c6c |
14 | 2749ccdc6841 |
15 | 12ad249164b8 |
hex | 94bcf1d48c9 |
10221202000073 has 2 divisors, whose sum is σ = 10221202000074. Its totient is φ = 10221202000072.
The previous prime is 10221202000043. The next prime is 10221202000157. The reversal of 10221202000073 is 37000020212201.
10221202000073 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8837254453504 + 1383947546569 = 2972752^2 + 1176413^2 .
It is a cyclic number.
It is not a de Polignac number, because 10221202000073 - 228 = 10220933564617 is a prime.
It is not a weakly prime, because it can be changed into another prime (10221202000033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5110601000036 + 5110601000037.
It is an arithmetic number, because the mean of its divisors is an integer number (5110601000037).
Almost surely, 210221202000073 is an apocalyptic number.
It is an amenable number.
10221202000073 is a deficient number, since it is larger than the sum of its proper divisors (1).
10221202000073 is an equidigital number, since it uses as much as digits as its factorization.
10221202000073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 336, while the sum is 20.
Adding to 10221202000073 its reverse (37000020212201), we get a palindrome (47221222212274).
The spelling of 10221202000073 in words is "ten trillion, two hundred twenty-one billion, two hundred two million, seventy-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •