Base | Representation |
---|---|
bin | 1010000110001010110110… |
… | …1101111101110101100101 |
3 | 1110022020220102221220200011 |
4 | 2201202231231331311211 |
5 | 2423340033130012442 |
6 | 35335440213450221 |
7 | 2224012566050332 |
oct | 241425555756545 |
9 | 43266812856604 |
10 | 11101110000997 |
11 | 359aa55210205 |
12 | 12b3577340971 |
13 | 626aa3ba6603 |
14 | 2a5421bb9989 |
15 | 143b730a3117 |
hex | a18adb7dd65 |
11101110000997 has 2 divisors, whose sum is σ = 11101110000998. Its totient is φ = 11101110000996.
The previous prime is 11101110000989. The next prime is 11101110001001. The reversal of 11101110000997 is 79900001110111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11097519714436 + 3590286561 = 3331294^2 + 59919^2 .
It is a cyclic number.
It is not a de Polignac number, because 11101110000997 - 23 = 11101110000989 is a prime.
It is a super-2 number, since 2×111011100009972 (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 (11101110000947) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550555000498 + 5550555000499.
It is an arithmetic number, because the mean of its divisors is an integer number (5550555000499).
Almost surely, 211101110000997 is an apocalyptic number.
It is an amenable number.
11101110000997 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101110000997 is an equidigital number, since it uses as much as digits as its factorization.
11101110000997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 567, while the sum is 31.
The spelling of 11101110000997 in words is "eleven trillion, one hundred one billion, one hundred ten million, nine hundred ninety-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •