Base | Representation |
---|---|
bin | 1001011000001111101011… |
… | …0110010100000000000101 |
3 | 1100111211102001222202212102 |
4 | 2112003322312110000011 |
5 | 2322423220243131401 |
6 | 33533154355201445 |
7 | 2113012124122223 |
oct | 226037266240005 |
9 | 40454361882772 |
10 | 10312130052101 |
11 | 3316393639a69 |
12 | 11a66875a6285 |
13 | 59a578055047 |
14 | 279177263b13 |
15 | 12d3974b156b |
hex | 960fad94005 |
10312130052101 has 2 divisors, whose sum is σ = 10312130052102. Its totient is φ = 10312130052100.
The previous prime is 10312130052061. The next prime is 10312130052113. The reversal of 10312130052101 is 10125003121301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5679308596900 + 4632821455201 = 2383130^2 + 2152399^2 .
It is a cyclic number.
It is not a de Polignac number, because 10312130052101 - 238 = 10037252145157 is a prime.
It is a super-2 number, since 2×103121300521012 (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 (10312130052131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5156065026050 + 5156065026051.
It is an arithmetic number, because the mean of its divisors is an integer number (5156065026051).
Almost surely, 210312130052101 is an apocalyptic number.
It is an amenable number.
10312130052101 is a deficient number, since it is larger than the sum of its proper divisors (1).
10312130052101 is an equidigital number, since it uses as much as digits as its factorization.
10312130052101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 180, while the sum is 20.
Adding to 10312130052101 its reverse (10125003121301), we get a palindrome (20437133173402).
The spelling of 10312130052101 in words is "ten trillion, three hundred twelve billion, one hundred thirty million, fifty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •