Base | Representation |
---|---|
bin | 1010000111011000110000… |
… | …1011010111100111010001 |
3 | 1110101020212211210121211002 |
4 | 2201312030023113213101 |
5 | 2424210400130314024 |
6 | 35353215245031345 |
7 | 2225353035116102 |
oct | 241661413274721 |
9 | 43336784717732 |
10 | 11122022119889 |
11 | 35a890659969a |
12 | 12b7632855555 |
13 | 628a5752ba65 |
14 | 2a64472943a9 |
15 | 144498e416ae |
hex | a1d8c2d79d1 |
11122022119889 has 2 divisors, whose sum is σ = 11122022119890. Its totient is φ = 11122022119888.
The previous prime is 11122022119861. The next prime is 11122022119891. The reversal of 11122022119889 is 98891122022111.
11122022119889 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11097506389264 + 24515730625 = 3331292^2 + 156575^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11122022119889 is a prime.
Together with 11122022119891, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (11122022119489) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5561011059944 + 5561011059945.
It is an arithmetic number, because the mean of its divisors is an integer number (5561011059945).
Almost surely, 211122022119889 is an apocalyptic number.
It is an amenable number.
11122022119889 is a deficient number, since it is larger than the sum of its proper divisors (1).
11122022119889 is an equidigital number, since it uses as much as digits as its factorization.
11122022119889 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 82944, while the sum is 47.
The spelling of 11122022119889 in words is "eleven trillion, one hundred twenty-two billion, twenty-two million, one hundred nineteen thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •