Base | Representation |
---|---|
bin | 1001010001110010100000… |
… | …1101100011110001000001 |
3 | 1100010020010200212111102022 |
4 | 2110130220031203301001 |
5 | 2314114100311033014 |
6 | 33410213210131225 |
7 | 2102004535025066 |
oct | 224345015436101 |
9 | 40106120774368 |
10 | 10201221971009 |
11 | 328334a948113 |
12 | 1189094720b15 |
13 | 58cc81692464 |
14 | 273a5561cc6d |
15 | 12a5557e2a8e |
hex | 94728363c41 |
10201221971009 has 2 divisors, whose sum is σ = 10201221971010. Its totient is φ = 10201221971008.
The previous prime is 10201221970967. The next prime is 10201221971011. The reversal of 10201221971009 is 90017912210201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10133736322609 + 67485648400 = 3183353^2 + 259780^2 .
It is a cyclic number.
It is not a de Polignac number, because 10201221971009 - 216 = 10201221905473 is a prime.
It is a Sophie Germain prime.
Together with 10201221971011, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10201221971009.
It is not a weakly prime, because it can be changed into another prime (10201221971029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5100610985504 + 5100610985505.
It is an arithmetic number, because the mean of its divisors is an integer number (5100610985505).
Almost surely, 210201221971009 is an apocalyptic number.
It is an amenable number.
10201221971009 is a deficient number, since it is larger than the sum of its proper divisors (1).
10201221971009 is an equidigital number, since it uses as much as digits as its factorization.
10201221971009 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4536, while the sum is 35.
The spelling of 10201221971009 in words is "ten trillion, two hundred one billion, two hundred twenty-one million, nine hundred seventy-one thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •