Base | Representation |
---|---|
bin | 1001001011111010001101… |
… | …1011011110000011110001 |
3 | 1022202120102000000201002001 |
4 | 2102332203123132003301 |
5 | 2310440212230000423 |
6 | 33251550013054001 |
7 | 2061500422320112 |
oct | 222764333360361 |
9 | 38676360021061 |
10 | 10100210000113 |
11 | 3244525262332 |
12 | 11715a3a87301 |
13 | 5835a4313b8c |
14 | 26cbd2016209 |
15 | 127ae280ecad |
hex | 92fa36de0f1 |
10100210000113 has 2 divisors, whose sum is σ = 10100210000114. Its totient is φ = 10100210000112.
The previous prime is 10100210000071. The next prime is 10100210000117. The reversal of 10100210000113 is 31100001200101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6964785471744 + 3135424528369 = 2639088^2 + 1770713^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10100210000113 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10100210000113.
It is not a weakly prime, because it can be changed into another prime (10100210000117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050105000056 + 5050105000057.
It is an arithmetic number, because the mean of its divisors is an integer number (5050105000057).
Almost surely, 210100210000113 is an apocalyptic number.
It is an amenable number.
10100210000113 is a deficient number, since it is larger than the sum of its proper divisors (1).
10100210000113 is an equidigital number, since it uses as much as digits as its factorization.
10100210000113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 10100210000113 its reverse (31100001200101), we get a palindrome (41200211200214).
The spelling of 10100210000113 in words is "ten trillion, one hundred billion, two hundred ten million, one hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.525 sec. • engine limits •