Base | Representation |
---|---|
bin | 1001011000001111010001… |
… | …0100001011110010001101 |
3 | 1100111211010102202000102102 |
4 | 2112003310110023302031 |
5 | 2322423004213123003 |
6 | 33533135442004445 |
7 | 2113006323344045 |
oct | 226036424136215 |
9 | 40454112660372 |
10 | 10312020442253 |
11 | 3316337784512 |
12 | 11a6656946725 |
13 | 59a55b42844a |
14 | 279166890725 |
15 | 12d38ca5e588 |
hex | 960f450bc8d |
10312020442253 has 2 divisors, whose sum is σ = 10312020442254. Its totient is φ = 10312020442252.
The previous prime is 10312020442121. The next prime is 10312020442271. The reversal of 10312020442253 is 35224402021301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10108819636969 + 203200805284 = 3179437^2 + 450778^2 .
It is an emirp because it is prime and its reverse (35224402021301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10312020442253 - 212 = 10312020438157 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10312020442453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5156010221126 + 5156010221127.
It is an arithmetic number, because the mean of its divisors is an integer number (5156010221127).
Almost surely, 210312020442253 is an apocalyptic number.
It is an amenable number.
10312020442253 is a deficient number, since it is larger than the sum of its proper divisors (1).
10312020442253 is an equidigital number, since it uses as much as digits as its factorization.
10312020442253 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11520, while the sum is 29.
Adding to 10312020442253 its reverse (35224402021301), we get a palindrome (45536422463554).
The spelling of 10312020442253 in words is "ten trillion, three hundred twelve billion, twenty million, four hundred forty-two thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •