Base | Representation |
---|---|
bin | 1010000111011000110000… |
… | …1011010111100001000001 |
3 | 1110101020212211210121021021 |
4 | 2201312030023113201001 |
5 | 2424210400130310424 |
6 | 35353215245025441 |
7 | 2225353035114661 |
oct | 241661413274101 |
9 | 43336784717237 |
10 | 11122022119489 |
11 | 35a8906599366 |
12 | 12b7632855281 |
13 | 628a5752b818 |
14 | 2a64472941a1 |
15 | 144498e414e4 |
hex | a1d8c2d7841 |
11122022119489 has 2 divisors, whose sum is σ = 11122022119490. Its totient is φ = 11122022119488.
The previous prime is 11122022119423. The next prime is 11122022119501. The reversal of 11122022119489 is 98491122022111.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11117609838864 + 4412280625 = 3334308^2 + 66425^2 .
It is a cyclic number.
It is not a de Polignac number, because 11122022119489 - 27 = 11122022119361 is a prime.
It is a super-2 number, since 2×111220221194892 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11122022119889) 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, 5561011059744 + 5561011059745.
It is an arithmetic number, because the mean of its divisors is an integer number (5561011059745).
Almost surely, 211122022119489 is an apocalyptic number.
It is an amenable number.
11122022119489 is a deficient number, since it is larger than the sum of its proper divisors (1).
11122022119489 is an equidigital number, since it uses as much as digits as its factorization.
11122022119489 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 41472, while the sum is 43.
The spelling of 11122022119489 in words is "eleven trillion, one hundred twenty-two billion, twenty-two million, one hundred nineteen thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •