Base | Representation |
---|---|
bin | 11001000011100111110001… |
… | …001010111110100000110011 |
3 | 112110012000112000102021010201 |
4 | 121003213301022332200303 |
5 | 103421004121124200034 |
6 | 1030213105151340031 |
7 | 32132455164360235 |
oct | 3103476112764063 |
9 | 473160460367121 |
10 | 110200022100019 |
11 | 32127626626475 |
12 | 10439604521617 |
13 | 4964a8205a867 |
14 | 1d2d9d0d36255 |
15 | cb184eaa0014 |
hex | 6439f12be833 |
110200022100019 has 8 divisors (see below), whose sum is σ = 113115996341568. Its totient is φ = 107307851730240.
The previous prime is 110200022099977. The next prime is 110200022100083. The reversal of 110200022100019 is 910001220002011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110200022100019 - 27 = 110200022099891 is a prime.
It is a super-2 number, since 2×1102000221000192 (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 = 110200022099969 and 110200022100005.
It is not an unprimeable number, because it can be changed into a prime (110200022101019) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5950958562 + ... + 5950977079.
It is an arithmetic number, because the mean of its divisors is an integer number (14139499542696).
Almost surely, 2110200022100019 is an apocalyptic number.
110200022100019 is a deficient number, since it is larger than the sum of its proper divisors (2915974241549).
110200022100019 is a wasteful number, since it uses less digits than its factorization.
110200022100019 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11901935885.
The product of its (nonzero) digits is 72, while the sum is 19.
The spelling of 110200022100019 in words is "one hundred ten trillion, two hundred billion, twenty-two million, one hundred thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •