Base | Representation |
---|---|
bin | 1100010101110011010… |
… | …1110110111011100000 |
3 | 202021020102010201110000 |
4 | 3011130311312323200 |
5 | 11433144310120000 |
6 | 241221351540000 |
7 | 21213554636013 |
oct | 3053465667340 |
9 | 667212121400 |
10 | 212011020000 |
11 | 81a0576a30a |
12 | 3510a08a600 |
13 | 16cb98418c0 |
14 | a39336b37a |
15 | 57acb70000 |
hex | 315cd76ee0 |
212011020000 has 600 divisors, whose sum is σ = 839166611976. Its totient is φ = 52182144000.
The previous prime is 212011019989. The next prime is 212011020029. The reversal of 212011020000 is 20110212.
It is a tau number, because it is divible by the number of its divisors (600).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 99 ways as a sum of consecutive naturals, for example, 21054967 + ... + 21065033.
Almost surely, 2212011020000 is an apocalyptic number.
212011020000 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 212011020000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (419583305988).
212011020000 is an abundant number, since it is smaller than the sum of its proper divisors (627155591976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212011020000 is a wasteful number, since it uses less digits than its factorization.
212011020000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10122 (or 10090 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 212011020000 its reverse (20110212), we get a palindrome (212031130212).
The spelling of 212011020000 in words is "two hundred twelve billion, eleven million, twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •