Base | Representation |
---|---|
bin | 1010000110110100010000… |
… | …0000010001111110111001 |
3 | 1110100022120210212100122011 |
4 | 2201231010000101332321 |
5 | 2424030312124202342 |
6 | 35344514535525521 |
7 | 2224555126514623 |
oct | 241550400217671 |
9 | 43308523770564 |
10 | 11112221319097 |
11 | 35a473726aa28 |
12 | 12b57585298a1 |
13 | 627b54ba8252 |
14 | 2a5b97785c13 |
15 | 1440c37d0717 |
hex | a1b44011fb9 |
11112221319097 has 2 divisors, whose sum is σ = 11112221319098. Its totient is φ = 11112221319096.
The previous prime is 11112221319091. The next prime is 11112221319137. The reversal of 11112221319097 is 79091312221111.
It is an a-pointer prime, because the next prime (11112221319137) can be obtained adding 11112221319097 to its sum of digits (40).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5765300418816 + 5346920900281 = 2401104^2 + 2312341^2 .
It is a cyclic number.
It is not a de Polignac number, because 11112221319097 - 27 = 11112221318969 is a prime.
It is not a weakly prime, because it can be changed into another prime (11112221319091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5556110659548 + 5556110659549.
It is an arithmetic number, because the mean of its divisors is an integer number (5556110659549).
Almost surely, 211112221319097 is an apocalyptic number.
It is an amenable number.
11112221319097 is a deficient number, since it is larger than the sum of its proper divisors (1).
11112221319097 is an equidigital number, since it uses as much as digits as its factorization.
11112221319097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13608, while the sum is 40.
The spelling of 11112221319097 in words is "eleven trillion, one hundred twelve billion, two hundred twenty-one million, three hundred nineteen thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •