Base | Representation |
---|---|
bin | 110000001110011101100001… |
… | …010010011110000101001000 |
3 | 1000210222120011211111210022212 |
4 | 300032131201102132011020 |
5 | 210300021301031210440 |
6 | 2031033221302004252 |
7 | 62450501531152163 |
oct | 6016354122360510 |
9 | 1023876154453285 |
10 | 212100002210120 |
11 | 616441188a27a2 |
12 | 1b956499716688 |
13 | 9146c37a8315b |
14 | 3a539a2a7aada |
15 | 197c31b4d4465 |
hex | c0e76149e148 |
212100002210120 has 64 divisors (see below), whose sum is σ = 481095823749120. Its totient is φ = 84152169609984.
The previous prime is 212100002210077. The next prime is 212100002210143. The reversal of 212100002210120 is 21012200001212.
It is a junction number, because it is equal to n+sod(n) for n = 212100002210095 and 212100002210104.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16696709 + ... + 26513771.
It is an arithmetic number, because the mean of its divisors is an integer number (7517122246080).
Almost surely, 2212100002210120 is an apocalyptic number.
212100002210120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
212100002210120 is an abundant number, since it is smaller than the sum of its proper divisors (268995821539000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212100002210120 is a wasteful number, since it uses less digits than its factorization.
212100002210120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9821454 (or 9821450 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 212100002210120 its reverse (21012200001212), we get a palindrome (233112202211332).
The spelling of 212100002210120 in words is "two hundred twelve trillion, one hundred billion, two million, two hundred ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •