Base | Representation |
---|---|
bin | 1011101001000110100… |
… | …1101010000011101110 |
3 | 201010021012002001012002 |
4 | 2322101221222003232 |
5 | 11234111100041420 |
6 | 231515001412302 |
7 | 20310325621166 |
oct | 2722151520356 |
9 | 633235061162 |
10 | 200012112110 |
11 | 77908694208 |
12 | 3291b79a092 |
13 | 15b269a01c5 |
14 | 99759555a6 |
15 | 5309568075 |
hex | 2e91a6a0ee |
200012112110 has 8 divisors (see below), whose sum is σ = 360021801816. Its totient is φ = 80004844840.
The previous prime is 200012112109. The next prime is 200012112119. The reversal of 200012112110 is 11211210002.
200012112110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 200012112091 and 200012112100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200012112119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10000605596 + ... + 10000605615.
It is an arithmetic number, because the mean of its divisors is an integer number (45002725227).
Almost surely, 2200012112110 is an apocalyptic number.
200012112110 is a deficient number, since it is larger than the sum of its proper divisors (160009689706).
200012112110 is a wasteful number, since it uses less digits than its factorization.
200012112110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20001211218.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 200012112110 its reverse (11211210002), we get a palindrome (211223322112).
The spelling of 200012112110 in words is "two hundred billion, twelve million, one hundred twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •