Base | Representation |
---|---|
bin | 1001010111101010011000… |
… | …1101000100100010010101 |
3 | 1100110212120110100110110002 |
4 | 2111322212031010202111 |
5 | 2322242220211120432 |
6 | 33524421213341045 |
7 | 2112206065215422 |
oct | 225724615044225 |
9 | 40425513313402 |
10 | 10302120020117 |
11 | 33121171a2862 |
12 | 11a4753197785 |
13 | 5996412645b3 |
14 | 2788a7a4cd49 |
15 | 12cead7c0e62 |
hex | 95ea6344895 |
10302120020117 has 2 divisors, whose sum is σ = 10302120020118. Its totient is φ = 10302120020116.
The previous prime is 10302120020053. The next prime is 10302120020141. The reversal of 10302120020117 is 71102002120301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10255423403281 + 46696616836 = 3202409^2 + 216094^2 .
It is a cyclic number.
It is not a de Polignac number, because 10302120020117 - 26 = 10302120020053 is a prime.
It is a super-2 number, since 2×103021200201172 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10302120020147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5151060010058 + 5151060010059.
It is an arithmetic number, because the mean of its divisors is an integer number (5151060010059).
Almost surely, 210302120020117 is an apocalyptic number.
It is an amenable number.
10302120020117 is a deficient number, since it is larger than the sum of its proper divisors (1).
10302120020117 is an equidigital number, since it uses as much as digits as its factorization.
10302120020117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 168, while the sum is 20.
Adding to 10302120020117 its reverse (71102002120301), we get a palindrome (81404122140418).
The spelling of 10302120020117 in words is "ten trillion, three hundred two billion, one hundred twenty million, twenty thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •