Base | Representation |
---|---|
bin | 110000001110110010010011… |
… | …101001110010011101101000 |
3 | 1000211001200210100011121202110 |
4 | 300032302103221302131220 |
5 | 210300403003414121300 |
6 | 2031051352141002320 |
7 | 62452221612335604 |
oct | 6016622351623550 |
9 | 1024050710147673 |
10 | 212122322020200 |
11 | 61652631843429 |
12 | 1b95a8885533a0 |
13 | 9149083c4aa77 |
14 | 3a54abd0aa504 |
15 | 197cbc5c36550 |
hex | c0ec93a72768 |
212122322020200 has 96 divisors (see below), whose sum is σ = 665902985731200. Its totient is φ = 55849927810560.
The previous prime is 212122322020183. The next prime is 212122322020247. The reversal of 212122322020200 is 2020223221212.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2237529837 + ... + 2237624636.
It is an arithmetic number, because the mean of its divisors is an integer number (6936489434700).
Almost surely, 2212122322020200 is an apocalyptic number.
212122322020200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
212122322020200 is an abundant number, since it is smaller than the sum of its proper divisors (453780663711000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212122322020200 is a wasteful number, since it uses less digits than its factorization.
212122322020200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4475154571 (or 4475154562 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 212122322020200 its reverse (2020223221212), we get a palindrome (214142545241412).
The spelling of 212122322020200 in words is "two hundred twelve trillion, one hundred twenty-two billion, three hundred twenty-two million, twenty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •