Base | Representation |
---|---|
bin | 10111001100011101010101… |
… | …011110100001011101000001 |
3 | 111101012011202002021210101021 |
4 | 113030131111132201131001 |
5 | 101332322420242441001 |
6 | 1000543144400105441 |
7 | 30326031455550133 |
oct | 2714352536413501 |
9 | 441164662253337 |
10 | 102011202312001 |
11 | 2a55a787307854 |
12 | b536555305281 |
13 | 44bc7cc4bb3a8 |
14 | 1b29523397053 |
15 | bbd82aea0ba1 |
hex | 5cc7557a1741 |
102011202312001 has 2 divisors, whose sum is σ = 102011202312002. Its totient is φ = 102011202312000.
The previous prime is 102011202311927. The next prime is 102011202312053. The reversal of 102011202312001 is 100213202110201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 78216318312001 + 23794884000000 = 8843999^2 + 4878000^2 .
It is an emirp because it is prime and its reverse (100213202110201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102011202312001 - 27 = 102011202311873 is a prime.
It is not a weakly prime, because it can be changed into another prime (102011200312001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51005601156000 + 51005601156001.
It is an arithmetic number, because the mean of its divisors is an integer number (51005601156001).
Almost surely, 2102011202312001 is an apocalyptic number.
It is an amenable number.
102011202312001 is a deficient number, since it is larger than the sum of its proper divisors (1).
102011202312001 is an equidigital number, since it uses as much as digits as its factorization.
102011202312001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 102011202312001 its reverse (100213202110201), we get a palindrome (202224404422202).
The spelling of 102011202312001 in words is "one hundred two trillion, eleven billion, two hundred two million, three hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •