Base | Representation |
---|---|
bin | 1010000110101100011011… |
… | …1000110110111000100001 |
3 | 1110100010011112001010111111 |
4 | 2201223012320312320201 |
5 | 2424012012242033324 |
6 | 35343530352543321 |
7 | 2224452120465433 |
oct | 241530670667041 |
9 | 43303145033444 |
10 | 11110122221089 |
11 | 35a385a398591 |
12 | 12b5271551b41 |
13 | 6278ac044b18 |
14 | 2a5a38a92653 |
15 | 143eee395794 |
hex | a1ac6e36e21 |
11110122221089 has 2 divisors, whose sum is σ = 11110122221090. Its totient is φ = 11110122221088.
The previous prime is 11110122221071. The next prime is 11110122221123. The reversal of 11110122221089 is 98012222101111.
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., 10719128384064 + 390993837025 = 3274008^2 + 625295^2 .
It is an emirp because it is prime and its reverse (98012222101111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11110122221089 - 221 = 11110120123937 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11110122221089.
It is not a weakly prime, because it can be changed into another prime (11110122221189) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5555061110544 + 5555061110545.
It is an arithmetic number, because the mean of its divisors is an integer number (5555061110545).
Almost surely, 211110122221089 is an apocalyptic number.
It is an amenable number.
11110122221089 is a deficient number, since it is larger than the sum of its proper divisors (1).
11110122221089 is an equidigital number, since it uses as much as digits as its factorization.
11110122221089 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 31.
The spelling of 11110122221089 in words is "eleven trillion, one hundred ten billion, one hundred twenty-two million, two hundred twenty-one thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •