Base | Representation |
---|---|
bin | 1001000110101110101000… |
… | …0001101110110100000101 |
3 | 1022110001122202020102000001 |
4 | 2101223222001232310011 |
5 | 2303010414212401432 |
6 | 33143025402321301 |
7 | 2052166604663455 |
oct | 221535201566405 |
9 | 38401582212001 |
10 | 10011200122117 |
11 | 320a7a9528597 |
12 | 11582a27b9231 |
13 | 57808a68090c |
14 | 26878a813d65 |
15 | 1256333629e7 |
hex | 91aea06ed05 |
10011200122117 has 2 divisors, whose sum is σ = 10011200122118. Its totient is φ = 10011200122116.
The previous prime is 10011200122109. The next prime is 10011200122123. The reversal of 10011200122117 is 71122100211001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8555572350081 + 1455627772036 = 2924991^2 + 1206494^2 .
It is a cyclic number.
It is not a de Polignac number, because 10011200122117 - 23 = 10011200122109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10011200122094 and 10011200122103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10011200126117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005600061058 + 5005600061059.
It is an arithmetic number, because the mean of its divisors is an integer number (5005600061059).
Almost surely, 210011200122117 is an apocalyptic number.
It is an amenable number.
10011200122117 is a deficient number, since it is larger than the sum of its proper divisors (1).
10011200122117 is an equidigital number, since it uses as much as digits as its factorization.
10011200122117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 56, while the sum is 19.
Adding to 10011200122117 its reverse (71122100211001), we get a palindrome (81133300333118).
The spelling of 10011200122117 in words is "ten trillion, eleven billion, two hundred million, one hundred twenty-two thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •