Base | Representation |
---|---|
bin | 110100010000011100… |
… | …1001001100100100011 |
3 | 101201122212121120101010 |
4 | 1220200321021210203 |
5 | 3314312034031034 |
6 | 123315325312003 |
7 | 11051640531000 |
oct | 1504071114443 |
9 | 351585546333 |
10 | 112221002019 |
11 | 43657914875 |
12 | 198ba705603 |
13 | a7756a2a99 |
14 | 560816a8a7 |
15 | 2dbc0b23e9 |
hex | 1a20e49923 |
112221002019 has 32 divisors (see below), whose sum is σ = 174658240000. Its totient is φ = 64065671712.
The previous prime is 112221002009. The next prime is 112221002029. The reversal of 112221002019 is 910200122211.
It is an interprime number because it is at equal distance from previous prime (112221002009) and next prime (112221002029).
It is not a de Polignac number, because 112221002019 - 212 = 112220997923 is a prime.
It is a super-2 number, since 2×1122210020192 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112221001986 and 112221002004.
It is not an unprimeable number, because it can be changed into a prime (112221002009) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1048992 + ... + 1151010.
It is an arithmetic number, because the mean of its divisors is an integer number (5458070000).
Almost surely, 2112221002019 is an apocalyptic number.
112221002019 is a deficient number, since it is larger than the sum of its proper divisors (62437237981).
112221002019 is a wasteful number, since it uses less digits than its factorization.
112221002019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103112 (or 103098 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 21.
The spelling of 112221002019 in words is "one hundred twelve billion, two hundred twenty-one million, two thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •