Base | Representation |
---|---|
bin | 1001001001010101100010… |
… | …01101111110110011011011 |
3 | 2122012200121120020202121112 |
4 | 10210222301031332303123 |
5 | 10114003344042042334 |
6 | 110435155131330535 |
7 | 4144021234201544 |
oct | 444526115766333 |
9 | 78180546222545 |
10 | 20112010112219 |
11 | 6454501431213 |
12 | 2309a135b0a4b |
13 | b2b72908894c |
14 | 4d75d83ad4cb |
15 | 24d25d68c4ce |
hex | 124ab137ecdb |
20112010112219 has 4 divisors (see below), whose sum is σ = 20760784632000. Its totient is φ = 19463235592440.
The previous prime is 20112010112213. The next prime is 20112010112263. The reversal of 20112010112219 is 91221101021102.
It is a happy number.
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 20112010112219 - 224 = 20111993335003 is a prime.
It is a super-2 number, since 2×201120101122192 (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 = 20112010112194 and 20112010112203.
It is not an unprimeable number, because it can be changed into a prime (20112010112213) 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, 324387259844 + ... + 324387259905.
It is an arithmetic number, because the mean of its divisors is an integer number (5190196158000).
Almost surely, 220112010112219 is an apocalyptic number.
20112010112219 is a deficient number, since it is larger than the sum of its proper divisors (648774519781).
20112010112219 is an equidigital number, since it uses as much as digits as its factorization.
20112010112219 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 648774519780.
The product of its (nonzero) digits is 144, while the sum is 23.
The spelling of 20112010112219 in words is "twenty trillion, one hundred twelve billion, ten million, one hundred twelve thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •