Base | Representation |
---|---|
bin | 100000000001000000111… |
… | …001101001101000101011 |
3 | 21210022212121002022122021 |
4 | 200001000321221220223 |
5 | 242021312200010443 |
6 | 4402414554005311 |
7 | 314644554242524 |
oct | 40010071515053 |
9 | 7708777068567 |
10 | 2200112110123 |
11 | 779075a24a84 |
12 | 2b6491116837 |
13 | 12c614b771a5 |
14 | 786b37d584b |
15 | 3c36b1e99ed |
hex | 20040e69a2b |
2200112110123 has 8 divisors (see below), whose sum is σ = 2452137336720. Its totient is φ = 1961709868800.
The previous prime is 2200112110081. The next prime is 2200112110151. The reversal of 2200112110123 is 3210112110022.
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 2200112110123 - 213 = 2200112101931 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2200112110097 and 2200112110106.
It is not an unprimeable number, because it can be changed into a prime (2200112116123) 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, 3405745978 + ... + 3405746623.
It is an arithmetic number, because the mean of its divisors is an integer number (306517167090).
Almost surely, 22200112110123 is an apocalyptic number.
2200112110123 is a deficient number, since it is larger than the sum of its proper divisors (252025226597).
2200112110123 is a wasteful number, since it uses less digits than its factorization.
2200112110123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6811492637.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 2200112110123 its reverse (3210112110022), we get a palindrome (5410224220145).
The spelling of 2200112110123 in words is "two trillion, two hundred billion, one hundred twelve million, one hundred ten thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •