Base | Representation |
---|---|
bin | 11001001111100011100010… |
… | …010001110101001010010011 |
3 | 112120002102022102100110021101 |
4 | 121033203202101311022103 |
5 | 104022423141403221034 |
6 | 1032041533534405231 |
7 | 32245636563055435 |
oct | 3117434221651223 |
9 | 476072272313241 |
10 | 111020110992019 |
11 | 32413401404049 |
12 | 10550536660817 |
13 | 49c41c7c36678 |
14 | 1d5b58b2c2655 |
15 | cc7d4b81b514 |
hex | 64f8e2475293 |
111020110992019 has 2 divisors, whose sum is σ = 111020110992020. Its totient is φ = 111020110992018.
The previous prime is 111020110991963. The next prime is 111020110992053. The reversal of 111020110992019 is 910299011020111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 111020110992019 - 211 = 111020110989971 is a prime.
It is a super-2 number, since 2×1110201109920192 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (111020110992059) 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, 55510055496009 + 55510055496010.
It is an arithmetic number, because the mean of its divisors is an integer number (55510055496010).
Almost surely, 2111020110992019 is an apocalyptic number.
111020110992019 is a deficient number, since it is larger than the sum of its proper divisors (1).
111020110992019 is an equidigital number, since it uses as much as digits as its factorization.
111020110992019 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 37.
The spelling of 111020110992019 in words is "one hundred eleven trillion, twenty billion, one hundred ten million, nine hundred ninety-two thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •