Base | Representation |
---|---|
bin | 10111010000101101001100… |
… | …100010000011110001101001 |
3 | 111102020002012122010210200021 |
4 | 113100231030202003301221 |
5 | 101402113232131121301 |
6 | 1001325222215240441 |
7 | 30356104302253156 |
oct | 2720551442036151 |
9 | 442202178123607 |
10 | 102303110020201 |
11 | 2a66256162a492 |
12 | b583040679121 |
13 | 45111ac931a4c |
14 | 1b396d588922d |
15 | bc6212ed38a1 |
hex | 5d0b4c883c69 |
102303110020201 has 2 divisors, whose sum is σ = 102303110020202. Its totient is φ = 102303110020200.
The previous prime is 102303110020147. The next prime is 102303110020207. The reversal of 102303110020201 is 102020011303201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 89848104422976 + 12455005597225 = 9478824^2 + 3529165^2 .
It is an emirp because it is prime and its reverse (102020011303201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102303110020201 - 27 = 102303110020073 is a prime.
It is not a weakly prime, because it can be changed into another prime (102303110020207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51151555010100 + 51151555010101.
It is an arithmetic number, because the mean of its divisors is an integer number (51151555010101).
Almost surely, 2102303110020201 is an apocalyptic number.
It is an amenable number.
102303110020201 is a deficient number, since it is larger than the sum of its proper divisors (1).
102303110020201 is an equidigital number, since it uses as much as digits as its factorization.
102303110020201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 102303110020201 its reverse (102020011303201), we get a palindrome (204323121323402).
The spelling of 102303110020201 in words is "one hundred two trillion, three hundred three billion, one hundred ten million, twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •