Base | Representation |
---|---|
bin | 1010000001100100001001… |
… | …1101100000000001001101 |
3 | 1110000200201012121220221201 |
4 | 2200121002131200001031 |
5 | 2421041024241023432 |
6 | 35235234251425501 |
7 | 2215212314430403 |
oct | 240310235400115 |
9 | 43020635556851 |
10 | 11022001111117 |
11 | 356a44a314377 |
12 | 12a0179a55291 |
13 | 61c4a75749b9 |
14 | 2a1679525473 |
15 | 141a92e56ee7 |
hex | a064276004d |
11022001111117 has 2 divisors, whose sum is σ = 11022001111118. Its totient is φ = 11022001111116.
The previous prime is 11022001111091. The next prime is 11022001111123. The reversal of 11022001111117 is 71111110022011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10917116459236 + 104884651881 = 3304106^2 + 323859^2 .
It is a cyclic number.
It is not a de Polignac number, because 11022001111117 - 235 = 10987641372749 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11022001111094 and 11022001111103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11022001181117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5511000555558 + 5511000555559.
It is an arithmetic number, because the mean of its divisors is an integer number (5511000555559).
Almost surely, 211022001111117 is an apocalyptic number.
It is an amenable number.
11022001111117 is a deficient number, since it is larger than the sum of its proper divisors (1).
11022001111117 is an equidigital number, since it uses as much as digits as its factorization.
11022001111117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28, while the sum is 19.
Adding to 11022001111117 its reverse (71111110022011), we get a palindrome (82133111133128).
The spelling of 11022001111117 in words is "eleven trillion, twenty-two billion, one million, one hundred eleven thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •