Base | Representation |
---|---|
bin | 110000001110101000101100… |
… | …011110111111100000011000 |
3 | 1000211000201011001201202001221 |
4 | 300032220230132333200120 |
5 | 210300220334301432300 |
6 | 2031042524054021424 |
7 | 62451405061000321 |
oct | 6016505436774030 |
9 | 1024021131652057 |
10 | 212112001202200 |
11 | 61649215a26080 |
12 | 1b958888047874 |
13 | 91480ca953c78 |
14 | 3a543c04b5448 |
15 | 197c7beb0631a |
hex | c0ea2c7bf818 |
212112001202200 has 96 divisors (see below), whose sum is σ = 538014571582320. Its totient is φ = 77128568000000.
The previous prime is 212112001202141. The next prime is 212112001202207. The reversal of 212112001202200 is 2202100211212.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212112001202207) by changing a digit.
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, 53756850 + ... + 57567550.
Almost surely, 2212112001202200 is an apocalyptic number.
212112001202200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
212112001202200 is an abundant number, since it is smaller than the sum of its proper divisors (325902570380120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212112001202200 is a wasteful number, since it uses less digits than its factorization.
212112001202200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3836029 (or 3836020 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 212112001202200 its reverse (2202100211212), we get a palindrome (214314101413412).
The spelling of 212112001202200 in words is "two hundred twelve trillion, one hundred twelve billion, one million, two hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •