Base | Representation |
---|---|
bin | 10111001100100101100010… |
… | …100010001010000100100001 |
3 | 111101020000110222221220120121 |
4 | 113030211202202022010201 |
5 | 101332443440343200301 |
6 | 1000551202435240241 |
7 | 30326462662002205 |
oct | 2714454242120441 |
9 | 441200428856517 |
10 | 102020011303201 |
11 | 2a5634977a7272 |
12 | b5381b3449081 |
13 | 44c05a4511a14 |
14 | 1b29b1b28ab05 |
15 | bbdb944ec3a1 |
hex | 5cc96288a121 |
102020011303201 has 2 divisors, whose sum is σ = 102020011303202. Its totient is φ = 102020011303200.
The previous prime is 102020011303181. The next prime is 102020011303207. The reversal of 102020011303201 is 102303110020201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 101932265014801 + 87746288400 = 10096151^2 + 296220^2 .
It is an emirp because it is prime and its reverse (102303110020201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102020011303201 - 25 = 102020011303169 is a prime.
It is not a weakly prime, because it can be changed into another prime (102020011303207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51010005651600 + 51010005651601.
It is an arithmetic number, because the mean of its divisors is an integer number (51010005651601).
Almost surely, 2102020011303201 is an apocalyptic number.
It is an amenable number.
102020011303201 is a deficient number, since it is larger than the sum of its proper divisors (1).
102020011303201 is an equidigital number, since it uses as much as digits as its factorization.
102020011303201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 102020011303201 its reverse (102303110020201), we get a palindrome (204323121323402).
The spelling of 102020011303201 in words is "one hundred two trillion, twenty billion, eleven million, three hundred three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •