Base | Representation |
---|---|
bin | 1100010110001000100… |
… | …1110010011000000000 |
3 | 202021110121210222210122 |
4 | 3011202021302120000 |
5 | 11433340113132204 |
6 | 241234253515412 |
7 | 21216016234556 |
oct | 3054211623000 |
9 | 667417728718 |
10 | 212100130304 |
11 | 81a50aa3197 |
12 | 35133aa2b68 |
13 | 170021418aa |
14 | a3a1125bd6 |
15 | 57b58c30be |
hex | 3162272600 |
212100130304 has 80 divisors (see below), whose sum is σ = 429658363200. Its totient is φ = 104583757824.
The previous prime is 212100130289. The next prime is 212100130321. The reversal of 212100130304 is 403031001212.
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 7 ways as a sum of consecutive naturals, for example, 40809434 + ... + 40814630.
It is an arithmetic number, because the mean of its divisors is an integer number (5370729540).
Almost surely, 2212100130304 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 212100130304, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (214829181600).
212100130304 is an abundant number, since it is smaller than the sum of its proper divisors (217558232896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212100130304 is an equidigital number, since it uses as much as digits as its factorization.
212100130304 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6303 (or 6287 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 212100130304 its reverse (403031001212), we get a palindrome (615131131516).
The spelling of 212100130304 in words is "two hundred twelve billion, one hundred million, one hundred thirty thousand, three hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •