Base | Representation |
---|---|
bin | 111011100110111… |
… | …0110101100100100 |
3 | 12011101120122200012 |
4 | 1313031312230210 |
5 | 13044012324422 |
6 | 530245305352 |
7 | 100364513300 |
oct | 16715665444 |
9 | 5141518605 |
10 | 2000120612 |
11 | 93701a246 |
12 | 479a05258 |
13 | 25b4ba229 |
14 | 14d8cad00 |
15 | ba8d84e2 |
hex | 77376b24 |
2000120612 has 72 divisors (see below), whose sum is σ = 4136487264. Its totient is φ = 843671808.
The previous prime is 2000120611. The next prime is 2000120621. The reversal of 2000120612 is 2160210002.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is not an unprimeable number, because it can be changed into a prime (2000120611) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5934908 + ... + 5935244.
It is an arithmetic number, because the mean of its divisors is an integer number (57451212).
Almost surely, 22000120612 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 2000120612, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2068243632).
2000120612 is an abundant number, since it is smaller than the sum of its proper divisors (2136366652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000120612 is a wasteful number, since it uses less digits than its factorization.
2000120612 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 745 (or 736 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 2000120612 is about 44722.7080128205. The cubic root of 2000120612 is about 1259.9463763187.
Adding to 2000120612 its reverse (2160210002), we get a palindrome (4160330614).
The spelling of 2000120612 in words is "two billion, one hundred twenty thousand, six hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •