Base | Representation |
---|---|
bin | 1001011000010000010100… |
… | …0110010100111001000101 |
3 | 1100111211212001120202111211 |
4 | 2112010011012110321011 |
5 | 2322424043304202323 |
6 | 33533223421131421 |
7 | 2113016312624632 |
oct | 226040506247105 |
9 | 40454761522454 |
10 | 10312302022213 |
11 | 3316471717724 |
12 | 11a67150b9b71 |
13 | 59a5a4876cc9 |
14 | 27919202b189 |
15 | 12d3a763070d |
hex | 96105194e45 |
10312302022213 has 2 divisors, whose sum is σ = 10312302022214. Its totient is φ = 10312302022212.
The previous prime is 10312302022177. The next prime is 10312302022259. The reversal of 10312302022213 is 31222020321301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7822274829889 + 2490027192324 = 2796833^2 + 1577982^2 .
It is a cyclic number.
It is not a de Polignac number, because 10312302022213 - 29 = 10312302021701 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10312302022273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5156151011106 + 5156151011107.
It is an arithmetic number, because the mean of its divisors is an integer number (5156151011107).
Almost surely, 210312302022213 is an apocalyptic number.
It is an amenable number.
10312302022213 is a deficient number, since it is larger than the sum of its proper divisors (1).
10312302022213 is an equidigital number, since it uses as much as digits as its factorization.
10312302022213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 10312302022213 its reverse (31222020321301), we get a palindrome (41534322343514).
The spelling of 10312302022213 in words is "ten trillion, three hundred twelve billion, three hundred two million, twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •