Base | Representation |
---|---|
bin | 1001001001001011100011… |
… | …0111110100101101100101 |
3 | 1022121002101111211201122111 |
4 | 2102102320313310231211 |
5 | 2304203202212123323 |
6 | 33214233411201021 |
7 | 2055220524341503 |
oct | 222227067645545 |
9 | 38532344751574 |
10 | 10053325114213 |
11 | 3226655a34647 |
12 | 116449a2a6171 |
13 | 57c041a61744 |
14 | 26a8252d5673 |
15 | 12679b69bc0d |
hex | 924b8df4b65 |
10053325114213 has 2 divisors, whose sum is σ = 10053325114214. Its totient is φ = 10053325114212.
The previous prime is 10053325114187. The next prime is 10053325114237. The reversal of 10053325114213 is 31241152335001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10033075255009 + 20249859204 = 3167503^2 + 142302^2 .
It is a cyclic number.
It is not a de Polignac number, because 10053325114213 - 25 = 10053325114181 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10053625114213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5026662557106 + 5026662557107.
It is an arithmetic number, because the mean of its divisors is an integer number (5026662557107).
Almost surely, 210053325114213 is an apocalyptic number.
It is an amenable number.
10053325114213 is a deficient number, since it is larger than the sum of its proper divisors (1).
10053325114213 is an equidigital number, since it uses as much as digits as its factorization.
10053325114213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10800, while the sum is 31.
Adding to 10053325114213 its reverse (31241152335001), we get a palindrome (41294477449214).
The spelling of 10053325114213 in words is "ten trillion, fifty-three billion, three hundred twenty-five million, one hundred fourteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •