Base | Representation |
---|---|
bin | 11001001111011010001110… |
… | …110001001110100111100011 |
3 | 112120001110112010112120112201 |
4 | 121033122032301032213203 |
5 | 104022242211210031034 |
6 | 1032033202313034031 |
7 | 32245134155050630 |
oct | 3117321661164743 |
9 | 476043463476481 |
10 | 111010120002019 |
11 | 3240a144793417 |
12 | 1054a6086b5917 |
13 | 49c3295082274 |
14 | 1d5acc0427187 |
15 | cc796463d014 |
hex | 64f68ec4e9e3 |
111010120002019 has 4 divisors (see below), whose sum is σ = 126868708573744. Its totient is φ = 95151531430296.
The previous prime is 111010120001993. The next prime is 111010120002029. The reversal of 111010120002019 is 910200021010111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 111010120002019 - 223 = 111010111613411 is a prime.
It is a super-2 number, since 2×1110101200020192 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111010120001987 and 111010120002005.
It is not an unprimeable number, because it can be changed into a prime (111010120002029) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7929294285852 + ... + 7929294285865.
It is an arithmetic number, because the mean of its divisors is an integer number (31717177143436).
Almost surely, 2111010120002019 is an apocalyptic number.
111010120002019 is a deficient number, since it is larger than the sum of its proper divisors (15858588571725).
111010120002019 is an equidigital number, since it uses as much as digits as its factorization.
111010120002019 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15858588571724.
The product of its (nonzero) digits is 36, while the sum is 19.
The spelling of 111010120002019 in words is "one hundred eleven trillion, ten billion, one hundred twenty million, two thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •