Base | Representation |
---|---|
bin | 110000001110100111110010… |
… | …000000110001000001000000 |
3 | 1000211000121121200210200001010 |
4 | 300032213302000301001000 |
5 | 210300211332132400000 |
6 | 2031042242451440520 |
7 | 62451341546422515 |
oct | 6016476200610100 |
9 | 1024017550720033 |
10 | 212111020200000 |
11 | 616488621a8659 |
12 | 1b9586535b6140 |
13 | 9147ca2638cac |
14 | 3a5432a0b130c |
15 | 197c763928d50 |
hex | c0e9f2031040 |
212111020200000 has 168 divisors, whose sum is σ = 701468114667264. Its totient is φ = 56562938560000.
The previous prime is 212111020199963. The next prime is 212111020200007. The reversal of 212111020200000 is 2020111212.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (212111020200007) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 176159184 + ... + 177359183.
It is an arithmetic number, because the mean of its divisors is an integer number (4175405444448).
Almost surely, 2212111020200000 is an apocalyptic number.
212111020200000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
212111020200000 is an abundant number, since it is smaller than the sum of its proper divisors (489357094467264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212111020200000 is an frugal number, since it uses more digits than its factorization.
212111020200000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 353518407 (or 353518377 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 212111020200000 its reverse (2020111212), we get a palindrome (212113040311212).
The spelling of 212111020200000 in words is "two hundred twelve trillion, one hundred eleven billion, twenty million, two hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •