Base | Representation |
---|---|
bin | 1001001101000011111110… |
… | …0110110111010110111001 |
3 | 1022211110111220102002221102 |
4 | 2103100333212313112321 |
5 | 2311301240041232301 |
6 | 33305022442021145 |
7 | 2063101166363216 |
oct | 223207746672671 |
9 | 38743456362842 |
10 | 10120010102201 |
11 | 325196596906a |
12 | 11753aaaa77b5 |
13 | 58540b46bb0c |
14 | 26db4d944b0d |
15 | 1283a0c41b6b |
hex | 9343f9b75b9 |
10120010102201 has 2 divisors, whose sum is σ = 10120010102202. Its totient is φ = 10120010102200.
The previous prime is 10120010102177. The next prime is 10120010102207. The reversal of 10120010102201 is 10220101002101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9001230042025 + 1118780060176 = 3000205^2 + 1057724^2 .
It is an emirp because it is prime and its reverse (10220101002101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10120010102201 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (10120010102207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5060005051100 + 5060005051101.
It is an arithmetic number, because the mean of its divisors is an integer number (5060005051101).
Almost surely, 210120010102201 is an apocalyptic number.
It is an amenable number.
10120010102201 is a deficient number, since it is larger than the sum of its proper divisors (1).
10120010102201 is an equidigital number, since it uses as much as digits as its factorization.
10120010102201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10120010102201 its reverse (10220101002101), we get a palindrome (20340111104302).
The spelling of 10120010102201 in words is "ten trillion, one hundred twenty billion, ten million, one hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •