Base | Representation |
---|---|
bin | 111011111010001… |
… | …0111000000000000 |
3 | 12012002120110202012 |
4 | 1313310113000000 |
5 | 13104103330100 |
6 | 531245512052 |
7 | 100546353245 |
oct | 16764270000 |
9 | 5162513665 |
10 | 2010214400 |
11 | 941793917 |
12 | 481272628 |
13 | 26061269c |
14 | 150d975cc |
15 | bb72e135 |
hex | 77d17000 |
2010214400 has 156 divisors (see below), whose sum is σ = 5076388632. Its totient is φ = 789381120.
The previous prime is 2010214361. The next prime is 2010214469. The reversal of 2010214400 is 44120102.
It is a congruent number.
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 11 ways as a sum of consecutive naturals, for example, 6860654 + ... + 6860946.
Almost surely, 22010214400 is an apocalyptic number.
2010214400 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2010214400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2538194316).
2010214400 is an abundant number, since it is smaller than the sum of its proper divisors (3066174232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2010214400 is an equidigital number, since it uses as much as digits as its factorization.
2010214400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 394 (or 367 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
The square root of 2010214400 is about 44835.4145737496. The cubic root of 2010214400 is about 1262.0622983554.
Adding to 2010214400 its reverse (44120102), we get a palindrome (2054334502).
The spelling of 2010214400 in words is "two billion, ten million, two hundred fourteen thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •