Base | Representation |
---|---|
bin | 111011111010110… |
… | …0010001000000000 |
3 | 12012010011002211221 |
4 | 1313311202020000 |
5 | 13104143201422 |
6 | 531300244424 |
7 | 100552104334 |
oct | 16765421000 |
9 | 5163132757 |
10 | 2010522112 |
11 | 941984025 |
12 | 4813a0714 |
13 | 2606bc771 |
14 | 1510377c4 |
15 | bb7903c7 |
hex | 77d62200 |
2010522112 has 80 divisors (see below), whose sum is σ = 4174232832. Its totient is φ = 966389760.
The previous prime is 2010522089. The next prime is 2010522139. The reversal of 2010522112 is 2112250102.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3126463 + ... + 3127105.
Almost surely, 22010522112 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 2010522112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2087116416).
2010522112 is an abundant number, since it is smaller than the sum of its proper divisors (2163710720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2010522112 is an equidigital number, since it uses as much as digits as its factorization.
2010522112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 889 (or 873 counting only the distinct ones).
The product of its (nonzero) digits is 80, while the sum is 16.
The square root of 2010522112 is about 44838.8460154808. The cubic root of 2010522112 is about 1262.1266914703.
Adding to 2010522112 its reverse (2112250102), we get a palindrome (4122772214).
The spelling of 2010522112 in words is "two billion, ten million, five hundred twenty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •