Base | Representation |
---|---|
bin | 1001010010111100111100… |
… | …0111010100100100011101 |
3 | 1100012010201010211010210212 |
4 | 2110233033013110210131 |
5 | 2314431010203001112 |
6 | 33423315543342205 |
7 | 2103312625333661 |
oct | 224571707244435 |
9 | 40163633733725 |
10 | 10221202000157 |
11 | 32908730767a5 |
12 | 1190b2ba51965 |
13 | 591b16b97005 |
14 | 2749ccdc68a1 |
15 | 12ad24916522 |
hex | 94bcf1d491d |
10221202000157 has 2 divisors, whose sum is σ = 10221202000158. Its totient is φ = 10221202000156.
The previous prime is 10221202000073. The next prime is 10221202000231. The reversal of 10221202000157 is 75100020212201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10167335767876 + 53866232281 = 3188626^2 + 232091^2 .
It is a cyclic number.
It is not a de Polignac number, because 10221202000157 - 232 = 10216907032861 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10221232000157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5110601000078 + 5110601000079.
It is an arithmetic number, because the mean of its divisors is an integer number (5110601000079).
Almost surely, 210221202000157 is an apocalyptic number.
It is an amenable number.
10221202000157 is a deficient number, since it is larger than the sum of its proper divisors (1).
10221202000157 is an equidigital number, since it uses as much as digits as its factorization.
10221202000157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 560, while the sum is 23.
Adding to 10221202000157 its reverse (75100020212201), we get a palindrome (85321222212358).
The spelling of 10221202000157 in words is "ten trillion, two hundred twenty-one billion, two hundred two million, one hundred fifty-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •