Base | Representation |
---|---|
bin | 1100010110100000011… |
… | …0110101110010000000 |
3 | 202021201120202222020111 |
4 | 3011220012311302000 |
5 | 11434041201133440 |
6 | 241252222521104 |
7 | 21221341263463 |
oct | 3055006656200 |
9 | 667646688214 |
10 | 212200021120 |
11 | 81aa241a68a |
12 | 35161436194 |
13 | 17019a47799 |
14 | a3b04c92da |
15 | 57be5554ea |
hex | 31681b5c80 |
212200021120 has 32 divisors (see below), whose sum is σ = 507290677020. Its totient is φ = 84880008192.
The previous prime is 212200021001. The next prime is 212200021139. The reversal of 212200021120 is 21120002212.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 212181839424 + 18181696 = 460632^2 + 4264^2 .
It is a tau number, because it is divible by the number of its divisors (32).
It is a self number, because there is not a number n which added to its sum of digits gives 212200021120.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 165780627 + ... + 165781906.
Almost surely, 2212200021120 is an apocalyptic number.
212200021120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
212200021120 is an abundant number, since it is smaller than the sum of its proper divisors (295090655900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212200021120 is an equidigital number, since it uses as much as digits as its factorization.
212200021120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 331562552 (or 331562540 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 212200021120 its reverse (21120002212), we get a palindrome (233320023332).
The spelling of 212200021120 in words is "two hundred twelve billion, two hundred million, twenty-one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •