Base | Representation |
---|---|
bin | 1001001100100111010000… |
… | …1000001100011110110001 |
3 | 1022210201121122222101220201 |
4 | 2103021310020030132301 |
5 | 2311134443114220423 |
6 | 33301305504035201 |
7 | 2062406152664656 |
oct | 223116410143661 |
9 | 38721548871821 |
10 | 10112301320113 |
11 | 324966a516a83 |
12 | 11739b9302b01 |
13 | 5847803703b5 |
14 | 26d61bc05c2d |
15 | 12809e0bd2ad |
hex | 9327420c7b1 |
10112301320113 has 2 divisors, whose sum is σ = 10112301320114. Its totient is φ = 10112301320112.
The previous prime is 10112301320047. The next prime is 10112301320123. The reversal of 10112301320113 is 31102310321101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9977808960289 + 134492359824 = 3158767^2 + 366732^2 .
It is a cyclic number.
It is not a de Polignac number, because 10112301320113 - 241 = 7913278064561 is a prime.
It is not a weakly prime, because it can be changed into another prime (10112301320123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5056150660056 + 5056150660057.
It is an arithmetic number, because the mean of its divisors is an integer number (5056150660057).
Almost surely, 210112301320113 is an apocalyptic number.
It is an amenable number.
10112301320113 is a deficient number, since it is larger than the sum of its proper divisors (1).
10112301320113 is an equidigital number, since it uses as much as digits as its factorization.
10112301320113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 10112301320113 its reverse (31102310321101), we get a palindrome (41214611641214).
The spelling of 10112301320113 in words is "ten trillion, one hundred twelve billion, three hundred one million, three hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •