Base | Representation |
---|---|
bin | 101111001011010101… |
… | …1000000001100101001 |
3 | 100200111121121002110212 |
4 | 1132112223000030221 |
5 | 3124441344300314 |
6 | 114313033550505 |
7 | 10214415445202 |
oct | 1362653001451 |
9 | 320447532425 |
10 | 101312103209 |
11 | 39a6a04a719 |
12 | 17775275435 |
13 | 97275c4685 |
14 | 4c914125a9 |
15 | 297e51ae3e |
hex | 1796ac0329 |
101312103209 has 2 divisors, whose sum is σ = 101312103210. Its totient is φ = 101312103208.
The previous prime is 101312103197. The next prime is 101312103239. The reversal of 101312103209 is 902301213101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 68616230809 + 32695872400 = 261947^2 + 180820^2 .
It is a cyclic number.
It is not a de Polignac number, because 101312103209 - 28 = 101312102953 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 (101312103239) 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, 50656051604 + 50656051605.
It is an arithmetic number, because the mean of its divisors is an integer number (50656051605).
Almost surely, 2101312103209 is an apocalyptic number.
It is an amenable number.
101312103209 is a deficient number, since it is larger than the sum of its proper divisors (1).
101312103209 is an equidigital number, since it uses as much as digits as its factorization.
101312103209 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 23.
The spelling of 101312103209 in words is "one hundred one billion, three hundred twelve million, one hundred three thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •