Base | Representation |
---|---|
bin | 110000001110110000001010… |
… | …011101000011001001110100 |
3 | 1000211001110211220220010221020 |
4 | 300032300022131003021310 |
5 | 210300333300132431400 |
6 | 2031050331513021140 |
7 | 62452110562242633 |
oct | 6016601235031164 |
9 | 1024043756803836 |
10 | 212120020202100 |
11 | 616516604a041a |
12 | 1b95a3456b47b0 |
13 | 9148aa80ba21a |
14 | 3a549414c751a |
15 | 197caddb062a0 |
hex | c0ec0a743274 |
212120020202100 has 36 divisors (see below), whose sum is σ = 613733925118944. Its totient is φ = 56565338720480.
The previous prime is 212120020202017. The next prime is 212120020202113. The reversal of 212120020202100 is 1202020021212.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 212120020202100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 353533366704 + ... + 353533367303.
Almost surely, 2212120020202100 is an apocalyptic number.
212120020202100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
212120020202100 is an abundant number, since it is smaller than the sum of its proper divisors (401613904916844).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212120020202100 is a wasteful number, since it uses less digits than its factorization.
212120020202100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 707066734024 (or 707066734017 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 212120020202100 its reverse (1202020021212), we get a palindrome (213322040223312).
The spelling of 212120020202100 in words is "two hundred twelve trillion, one hundred twenty billion, twenty million, two hundred two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •