Base | Representation |
---|---|
bin | 1001001100101111100101… |
… | …0001011010001001110001 |
3 | 1022210221101100020102220101 |
4 | 2103023321101122021301 |
5 | 2311204031441331022 |
6 | 33302315301512401 |
7 | 2062515415565521 |
oct | 223137121321161 |
9 | 38727340212811 |
10 | 10114535105137 |
11 | 324a606421801 |
12 | 1174321412701 |
13 | 584a480a0798 |
14 | 26d790759681 |
15 | 128180260627 |
hex | 932f945a271 |
10114535105137 has 2 divisors, whose sum is σ = 10114535105138. Its totient is φ = 10114535105136.
The previous prime is 10114535105113. The next prime is 10114535105153. The reversal of 10114535105137 is 73150153541101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8906637391201 + 1207897713936 = 2984399^2 + 1099044^2 .
It is a cyclic number.
It is not a de Polignac number, because 10114535105137 - 223 = 10114526716529 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10114535105096 and 10114535105105.
It is not a weakly prime, because it can be changed into another prime (10114535102137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5057267552568 + 5057267552569.
It is an arithmetic number, because the mean of its divisors is an integer number (5057267552569).
Almost surely, 210114535105137 is an apocalyptic number.
It is an amenable number.
10114535105137 is a deficient number, since it is larger than the sum of its proper divisors (1).
10114535105137 is an equidigital number, since it uses as much as digits as its factorization.
10114535105137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31500, while the sum is 37.
Adding to 10114535105137 its reverse (73150153541101), we get a palindrome (83264688646238).
The spelling of 10114535105137 in words is "ten trillion, one hundred fourteen billion, five hundred thirty-five million, one hundred five thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •