Base | Representation |
---|---|
bin | 110000001110011101100001… |
… | …010010100000100001011000 |
3 | 1000210222120011211112022001020 |
4 | 300032131201102200201120 |
5 | 210300021301032020440 |
6 | 2031033221302122440 |
7 | 62450501531223300 |
oct | 6016354122404130 |
9 | 1023876154468036 |
10 | 212100002220120 |
11 | 616441188aa263 |
12 | 1b956499720420 |
13 | 9146c37a87881 |
14 | 3a539a2a80600 |
15 | 197c31b4d73d0 |
hex | c0e7614a0858 |
212100002220120 has 96 divisors (see below), whose sum is σ = 740185722054000. Its totient is φ = 48480000506112.
The previous prime is 212100002220083. The next prime is 212100002220143. The reversal of 212100002220120 is 21022200001212.
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 212100002220120.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 18035708595 + ... + 18035720354.
Almost surely, 2212100002220120 is an apocalyptic number.
212100002220120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
212100002220120 is an abundant number, since it is smaller than the sum of its proper divisors (528085719833880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212100002220120 is a wasteful number, since it uses less digits than its factorization.
212100002220120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36071428977 (or 36071428966 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 212100002220120 its reverse (21022200001212), we get a palindrome (233122202221332).
The spelling of 212100002220120 in words is "two hundred twelve trillion, one hundred billion, two million, two hundred twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •