Base | Representation |
---|---|
bin | 1110100011100111011101… |
… | …01101111100101001011101 |
3 | 11012100010122222221102122022 |
4 | 13101303232231330221131 |
5 | 13143423141413441333 |
6 | 152025123150225525 |
7 | 6512440102544612 |
oct | 721635655745135 |
9 | 135303588842568 |
10 | 32010101312093 |
11 | a221453764153 |
12 | 370b9321b52a5 |
13 | 14b2702673868 |
14 | 7c9423612509 |
15 | 3a79c99c7c98 |
hex | 1d1ceeb7ca5d |
32010101312093 has 2 divisors, whose sum is σ = 32010101312094. Its totient is φ = 32010101312092.
The previous prime is 32010101312039. The next prime is 32010101312113. The reversal of 32010101312093 is 39021310101023.
Together with previous prime (32010101312039) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 27193753146169 + 4816348165924 = 5214763^2 + 2194618^2 .
It is an emirp because it is prime and its reverse (39021310101023) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 32010101312093 - 224 = 32010084534877 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32010101312003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16005050656046 + 16005050656047.
It is an arithmetic number, because the mean of its divisors is an integer number (16005050656047).
Almost surely, 232010101312093 is an apocalyptic number.
It is an amenable number.
32010101312093 is a deficient number, since it is larger than the sum of its proper divisors (1).
32010101312093 is an equidigital number, since it uses as much as digits as its factorization.
32010101312093 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 26.
The spelling of 32010101312093 in words is "thirty-two trillion, ten billion, one hundred one million, three hundred twelve thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •