Base | Representation |
---|---|
bin | 1001001001010101101110… |
… | …10011000101000111110111 |
3 | 2122012200212200011220011121 |
4 | 10210222313103011013313 |
5 | 10114004101200041434 |
6 | 110435213213444411 |
7 | 4144023613163416 |
oct | 444526723050767 |
9 | 78180780156147 |
10 | 20112112112119 |
11 | 6454553a69255 |
12 | 2309a417a0707 |
13 | b2b74424c811 |
14 | 4d7607b6147d |
15 | 24d2675d97b4 |
hex | 124ab74c51f7 |
20112112112119 has 4 divisors (see below), whose sum is σ = 20270475199744. Its totient is φ = 19953749024496.
The previous prime is 20112112112117. The next prime is 20112112112123. The reversal of 20112112112119 is 91121121121102.
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 20112112112119 - 21 = 20112112112117 is a prime.
It is a super-2 number, since 2×201121121121192 (a number of 27 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 = 20112112112093 and 20112112112102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20112112112117) 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, 79181543622 + ... + 79181543875.
It is an arithmetic number, because the mean of its divisors is an integer number (5067618799936).
Almost surely, 220112112112119 is an apocalyptic number.
20112112112119 is a deficient number, since it is larger than the sum of its proper divisors (158363087625).
20112112112119 is a wasteful number, since it uses less digits than its factorization.
20112112112119 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 158363087624.
The product of its (nonzero) digits is 144, while the sum is 25.
The spelling of 20112112112119 in words is "twenty trillion, one hundred twelve billion, one hundred twelve million, one hundred twelve thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •