Base | Representation |
---|---|
bin | 1001010001110010111000… |
… | …0100101100110100101101 |
3 | 1100010020101112220202001021 |
4 | 2110130232010230310231 |
5 | 2314114300444441414 |
6 | 33410231042014141 |
7 | 2102010140640613 |
oct | 224345604546455 |
9 | 40106345822037 |
10 | 10201320312109 |
11 | 32833a0406253 |
12 | 1189101647351 |
13 | 58cc98b74b64 |
14 | 273a646db6b3 |
15 | 12a55e26ac24 |
hex | 9472e12cd2d |
10201320312109 has 2 divisors, whose sum is σ = 10201320312110. Its totient is φ = 10201320312108.
The previous prime is 10201320312091. The next prime is 10201320312217. The reversal of 10201320312109 is 90121302310201.
Together with previous prime (10201320312091) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7634445302500 + 2566875009609 = 2763050^2 + 1602147^2 .
It is a cyclic number.
It is not a de Polignac number, because 10201320312109 - 241 = 8002297056557 is a prime.
It is a super-2 number, since 2×102013203121092 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10201320372109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5100660156054 + 5100660156055.
It is an arithmetic number, because the mean of its divisors is an integer number (5100660156055).
Almost surely, 210201320312109 is an apocalyptic number.
It is an amenable number.
10201320312109 is a deficient number, since it is larger than the sum of its proper divisors (1).
10201320312109 is an equidigital number, since it uses as much as digits as its factorization.
10201320312109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 25.
The spelling of 10201320312109 in words is "ten trillion, two hundred one billion, three hundred twenty million, three hundred twelve thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •