Base | Representation |
---|---|
bin | 1001010001110110001010… |
… | …0001010101000010100101 |
3 | 1100010022122212122022100121 |
4 | 2110131202201111002211 |
5 | 2314123101224411401 |
6 | 33410454233441541 |
7 | 2102041014065203 |
oct | 224354241250245 |
9 | 40108585568317 |
10 | 10202200232101 |
11 | 3283802073159 |
12 | 11893082702b1 |
13 | 5900a925a887 |
14 | 273b0950c073 |
15 | 12a5b162cca1 |
hex | 947628550a5 |
10202200232101 has 2 divisors, whose sum is σ = 10202200232102. Its totient is φ = 10202200232100.
The previous prime is 10202200232093. The next prime is 10202200232129. The reversal of 10202200232101 is 10123200220201.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6276753569025 + 3925446663076 = 2505345^2 + 1981274^2 .
It is an emirp because it is prime and its reverse (10123200220201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10202200232101 - 23 = 10202200232093 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10202200233101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5101100116050 + 5101100116051.
It is an arithmetic number, because the mean of its divisors is an integer number (5101100116051).
Almost surely, 210202200232101 is an apocalyptic number.
It is an amenable number.
10202200232101 is a deficient number, since it is larger than the sum of its proper divisors (1).
10202200232101 is an equidigital number, since it uses as much as digits as its factorization.
10202200232101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 10202200232101 its reverse (10123200220201), we get a palindrome (20325400452302).
The spelling of 10202200232101 in words is "ten trillion, two hundred two billion, two hundred million, two hundred thirty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.159 sec. • engine limits •