Base | Representation |
---|---|
bin | 111011100110111… |
… | …0100001010000100 |
3 | 12011101120010102000 |
4 | 1313031310022010 |
5 | 13044012011322 |
6 | 530245145300 |
7 | 100364441052 |
oct | 16715641204 |
9 | 5141503360 |
10 | 2000110212 |
11 | 937012451 |
12 | 4799bb230 |
13 | 25b4b5589 |
14 | 14d8c71d2 |
15 | ba8d53ac |
hex | 77374284 |
2000110212 has 96 divisors (see below), whose sum is σ = 5297160960. Its totient is φ = 652458240.
The previous prime is 2000110201. The next prime is 2000110243. The reversal of 2000110212 is 2120110002.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 2000110194 and 2000110203.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1534353 + ... + 1535655.
It is an arithmetic number, because the mean of its divisors is an integer number (55178760).
Almost surely, 22000110212 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2000110212, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2648580480).
2000110212 is an abundant number, since it is smaller than the sum of its proper divisors (3297050748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000110212 is a wasteful number, since it uses less digits than its factorization.
2000110212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1610 (or 1602 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
The square root of 2000110212 is about 44722.5917406404. The cubic root of 2000110212 is about 1259.9441925396.
Adding to 2000110212 its reverse (2120110002), we get a palindrome (4120220214).
The spelling of 2000110212 in words is "two billion, one hundred ten thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •