Base | Representation |
---|---|
bin | 11001010000110111010111… |
… | …001111010111101110101100 |
3 | 112120102000122022101110022111 |
4 | 121100313113033113232230 |
5 | 104030412011222023040 |
6 | 1032151141242253404 |
7 | 32255304233002132 |
oct | 3120672717275654 |
9 | 476360568343274 |
10 | 111110120111020 |
11 | 324485a01933a8 |
12 | 10565a764b7264 |
13 | 49cc8408cc4b4 |
14 | 1d61a894b5752 |
15 | cca368899dea |
hex | 650dd73d7bac |
111110120111020 has 12 divisors (see below), whose sum is σ = 233331252233184. Its totient is φ = 44444048044400.
The previous prime is 111110120110991. The next prime is 111110120111113. The reversal of 111110120111020 is 20111021011111.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2777753002756 + ... + 2777753002795.
It is an arithmetic number, because the mean of its divisors is an integer number (19444271019432).
Almost surely, 2111110120111020 is an apocalyptic number.
111110120111020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
111110120111020 is an abundant number, since it is smaller than the sum of its proper divisors (122221132122164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111110120111020 is a wasteful number, since it uses less digits than its factorization.
111110120111020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5555506005560 (or 5555506005558 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 111110120111020 its reverse (20111021011111), we get a palindrome (131221141122131).
Subtracting from 111110120111020 its reverse (20111021011111), we obtain a palindrome (90999099099909).
The spelling of 111110120111020 in words is "one hundred eleven trillion, one hundred ten billion, one hundred twenty million, one hundred eleven thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •