Base | Representation |
---|---|
bin | 100000000001000000110… |
… | …010011001101111100011 |
3 | 21210022212110111210012001 |
4 | 200001000302121233203 |
5 | 242021311203210034 |
6 | 4402414445144431 |
7 | 314644532140051 |
oct | 40010062315743 |
9 | 7708773453161 |
10 | 2200110210019 |
11 | 779074947447 |
12 | 2b649055b117 |
13 | 12c614660377 |
14 | 786b345d1d1 |
15 | 3c36ae71a14 |
hex | 20040c99be3 |
2200110210019 has 12 divisors (see below), whose sum is σ = 2377661388336. Its totient is φ = 2031885873248.
The previous prime is 2200110210017. The next prime is 2200110210049. The reversal of 2200110210019 is 9100120110022.
It is a happy number.
It is not a de Polignac number, because 2200110210019 - 21 = 2200110210017 is a prime.
It is a super-2 number, since 2×22001102100192 (a number of 25 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 = 2200110209978 and 2200110210005.
It is not an unprimeable number, because it can be changed into a prime (2200110210017) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 56851624 + ... + 56890309.
It is an arithmetic number, because the mean of its divisors is an integer number (198138449028).
Almost surely, 22200110210019 is an apocalyptic number.
2200110210019 is a gapful number since it is divisible by the number (29) formed by its first and last digit.
2200110210019 is a deficient number, since it is larger than the sum of its proper divisors (177551178317).
2200110210019 is a wasteful number, since it uses less digits than its factorization.
2200110210019 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 113742014 (or 113741985 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 19.
The spelling of 2200110210019 in words is "two trillion, two hundred billion, one hundred ten million, two hundred ten thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •