Base | Representation |
---|---|
bin | 1010000000010110101010… |
… | …1011110101101101000101 |
3 | 1102221201000121210000002202 |
4 | 2200011222223311231011 |
5 | 2420220424441401432 |
6 | 35221514303444245 |
7 | 2213545006434143 |
oct | 240055253655505 |
9 | 42851017700082 |
10 | 11001201122117 |
11 | 3561646261818 |
12 | 1298133bb6685 |
13 | 61a54121c1bb |
14 | 2a0664cb8593 |
15 | 141276d67462 |
hex | a016aaf5b45 |
11001201122117 has 2 divisors, whose sum is σ = 11001201122118. Its totient is φ = 11001201122116.
The previous prime is 11001201122089. The next prime is 11001201122299. The reversal of 11001201122117 is 71122110210011.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10863095238241 + 138105883876 = 3295921^2 + 371626^2 .
It is a cyclic number.
It is not a de Polignac number, because 11001201122117 - 28 = 11001201121861 is a prime.
It is a super-2 number, since 2×110012011221172 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11001201122017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500600561058 + 5500600561059.
It is an arithmetic number, because the mean of its divisors is an integer number (5500600561059).
Almost surely, 211001201122117 is an apocalyptic number.
It is an amenable number.
11001201122117 is a deficient number, since it is larger than the sum of its proper divisors (1).
11001201122117 is an equidigital number, since it uses as much as digits as its factorization.
11001201122117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 20.
Adding to 11001201122117 its reverse (71122110210011), we get a palindrome (82123311332128).
The spelling of 11001201122117 in words is "eleven trillion, one billion, two hundred one million, one hundred twenty-two thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •