Base | Representation |
---|---|
bin | 1001010001110010001000… |
… | …1001000010000011001111 |
3 | 1100010012212121012222112012 |
4 | 2110130202021002003033 |
5 | 2314113343222333124 |
6 | 33410155131131435 |
7 | 2102002160226311 |
oct | 224344211020317 |
9 | 40105777188465 |
10 | 10201120121039 |
11 | 32832a8402791 |
12 | 11890665a3b7b |
13 | 58cc665518c3 |
14 | 273a45ca97b1 |
15 | 12a54b8c4e0e |
hex | 947222420cf |
10201120121039 has 2 divisors, whose sum is σ = 10201120121040. Its totient is φ = 10201120121038.
The previous prime is 10201120120987. The next prime is 10201120121047. The reversal of 10201120121039 is 93012102110201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10201120121039 - 232 = 10196825153743 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10201120121089) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5100560060519 + 5100560060520.
It is an arithmetic number, because the mean of its divisors is an integer number (5100560060520).
Almost surely, 210201120121039 is an apocalyptic number.
10201120121039 is a deficient number, since it is larger than the sum of its proper divisors (1).
10201120121039 is an equidigital number, since it uses as much as digits as its factorization.
10201120121039 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 23.
The spelling of 10201120121039 in words is "ten trillion, two hundred one billion, one hundred twenty million, one hundred twenty-one thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •