Base | Representation |
---|---|
bin | 1010000111010001001110… |
… | …1001100110011111000111 |
3 | 1110101001122220211101112121 |
4 | 2201310103221212133013 |
5 | 2424142230000030431 |
6 | 35352242452030411 |
7 | 2225251652314456 |
oct | 241642351463707 |
9 | 43331586741477 |
10 | 11120000001991 |
11 | 35a7a69115581 |
12 | 12b7169602407 |
13 | 6287c460c2aa |
14 | 2a62d48bcb9d |
15 | 1443cb660611 |
hex | a1d13a667c7 |
11120000001991 has 2 divisors, whose sum is σ = 11120000001992. Its totient is φ = 11120000001990.
The previous prime is 11120000001989. The next prime is 11120000002031. The reversal of 11120000001991 is 19910000002111.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11120000001991 - 21 = 11120000001989 is a prime.
Together with 11120000001989, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11120000001191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5560000000995 + 5560000000996.
It is an arithmetic number, because the mean of its divisors is an integer number (5560000000996).
Almost surely, 211120000001991 is an apocalyptic number.
11120000001991 is a deficient number, since it is larger than the sum of its proper divisors (1).
11120000001991 is an equidigital number, since it uses as much as digits as its factorization.
11120000001991 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 25.
The spelling of 11120000001991 in words is "eleven trillion, one hundred twenty billion, one thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •