Base | Representation |
---|---|
bin | 1100010101111000101… |
… | …0001100111001110100 |
3 | 202021021221202000210121 |
4 | 3011132022030321310 |
5 | 11433220440130400 |
6 | 241223501501324 |
7 | 21214243603651 |
oct | 3053612147164 |
9 | 667257660717 |
10 | 212033130100 |
11 | 81a171a0a20 |
12 | 35115571844 |
13 | 16cc12b35bc |
14 | a396284c28 |
15 | 57aea8b21a |
hex | 315e28ce74 |
212033130100 has 72 divisors (see below), whose sum is σ = 504568705536. Its totient is φ = 76699200000.
The previous prime is 212033130091. The next prime is 212033130131. The reversal of 212033130100 is 1031330212.
212033130100 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 294501 + ... + 714700.
It is an arithmetic number, because the mean of its divisors is an integer number (7007898688).
Almost surely, 2212033130100 is an apocalyptic number.
212033130100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
212033130100 is an abundant number, since it is smaller than the sum of its proper divisors (292535575436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212033130100 is a wasteful number, since it uses less digits than its factorization.
212033130100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1009417 (or 1009410 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 212033130100 its reverse (1031330212), we get a palindrome (213064460312).
The spelling of 212033130100 in words is "two hundred twelve billion, thirty-three million, one hundred thirty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •