Base | Representation |
---|---|
bin | 110000001111111100100110… |
… | …110011000101100111000000 |
3 | 1000211100022201012201222220111 |
4 | 300033330212303011213000 |
5 | 210303204400112320000 |
6 | 2031152144330321104 |
7 | 62461044601111054 |
oct | 6017744663054700 |
9 | 1024308635658814 |
10 | 212202100120000 |
11 | 61683450469611 |
12 | 1b972231b89194 |
13 | 91537590cb293 |
14 | 3a588ca5a1c64 |
15 | 197ece49c1cba |
hex | c0ff26cc59c0 |
212202100120000 has 70 divisors (see below), whose sum is σ = 526192242714248. Its totient is φ = 84880840032000.
The previous prime is 212202100119943. The next prime is 212202100120009. The reversal of 212202100120000 is 21001202212.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212202100120009) 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 9 ways as a sum of consecutive naturals, for example, 2652486252 + ... + 2652566251.
Almost surely, 2212202100120000 is an apocalyptic number.
212202100120000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
212202100120000 is an abundant number, since it is smaller than the sum of its proper divisors (313990142594248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212202100120000 is an frugal number, since it uses more digits than its factorization.
212202100120000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5305052535 (or 5305052510 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 212202100120000 its reverse (21001202212), we get a palindrome (212223101322212).
The spelling of 212202100120000 in words is "two hundred twelve trillion, two hundred two billion, one hundred million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •