Base | Representation |
---|---|
bin | 110000000000001101110000… |
… | …110111110110000000011000 |
3 | 1000200111222020021001200021122 |
4 | 300000031300313312000120 |
5 | 210133001312321402300 |
6 | 2025003353101224412 |
7 | 62316663316206524 |
oct | 6000156067660030 |
9 | 1020458207050248 |
10 | 211121011122200 |
11 | 612a6a10957463 |
12 | 1b8187bb562108 |
13 | 90a581a1cca4a |
14 | 3a1c450906d84 |
15 | 1961b1e37ac85 |
hex | c00370df6018 |
211121011122200 has 96 divisors (see below), whose sum is σ = 503489218846320. Its totient is φ = 82280421120000.
The previous prime is 211121011122163. The next prime is 211121011122209. The reversal of 211121011122200 is 2221110121112.
It is a super-2 number, since 2×2111210111222002 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211121011122209) 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, 10676006 + ... + 23156405.
Almost surely, 2211121011122200 is an apocalyptic number.
211121011122200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
211121011122200 is an abundant number, since it is smaller than the sum of its proper divisors (292368207724120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211121011122200 is a wasteful number, since it uses less digits than its factorization.
211121011122200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33833229 (or 33833220 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 211121011122200 its reverse (2221110121112), we get a palindrome (213342121243312).
The spelling of 211121011122200 in words is "two hundred eleven trillion, one hundred twenty-one billion, eleven million, one hundred twenty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •