Base | Representation |
---|---|
bin | 1001001001001011100011… |
… | …0111110100101101111101 |
3 | 1022121002101111211201200101 |
4 | 2102102320313310231331 |
5 | 2304203202212123422 |
6 | 33214233411201101 |
7 | 2055220524341536 |
oct | 222227067645575 |
9 | 38532344751611 |
10 | 10053325114237 |
11 | 3226655a34669 |
12 | 116449a2a6191 |
13 | 57c041a61762 |
14 | 26a8252d568d |
15 | 12679b69bc27 |
hex | 924b8df4b7d |
10053325114237 has 2 divisors, whose sum is σ = 10053325114238. Its totient is φ = 10053325114236.
The previous prime is 10053325114213. The next prime is 10053325114277. The reversal of 10053325114237 is 73241152335001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6193558006596 + 3859767107641 = 2488686^2 + 1964629^2 .
It is a cyclic number.
It is not a de Polignac number, because 10053325114237 - 243 = 1257232092029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10053325114196 and 10053325114205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10053325114277) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5026662557118 + 5026662557119.
It is an arithmetic number, because the mean of its divisors is an integer number (5026662557119).
Almost surely, 210053325114237 is an apocalyptic number.
It is an amenable number.
10053325114237 is a deficient number, since it is larger than the sum of its proper divisors (1).
10053325114237 is an equidigital number, since it uses as much as digits as its factorization.
10053325114237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 75600, while the sum is 37.
Adding to 10053325114237 its reverse (73241152335001), we get a palindrome (83294477449238).
The spelling of 10053325114237 in words is "ten trillion, fifty-three billion, three hundred twenty-five million, one hundred fourteen thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.170 sec. • engine limits •