Base | Representation |
---|---|
bin | 11110101110111101000… |
… | …100110111000010111000 |
3 | 21110220102222200202110202 |
4 | 132232331010313002320 |
5 | 234100334241011300 |
6 | 4254123453301332 |
7 | 305405233143032 |
oct | 36567504670270 |
9 | 7426388622422 |
10 | 2112001110200 |
11 | 744770626683 |
12 | 2a13a0a94848 |
13 | 124212506a47 |
14 | 7431573ac52 |
15 | 39e10b06ad5 |
hex | 1ebbd1370b8 |
2112001110200 has 48 divisors (see below), whose sum is σ = 5030168517360. Its totient is φ = 824195552000.
The previous prime is 2112001110187. The next prime is 2112001110209. The reversal of 2112001110200 is 20111002112.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2112001110209) 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 11 ways as a sum of consecutive naturals, for example, 128772356 + ... + 128788755.
It is an arithmetic number, because the mean of its divisors is an integer number (104795177445).
Almost surely, 22112001110200 is an apocalyptic number.
2112001110200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2112001110200 is an abundant number, since it is smaller than the sum of its proper divisors (2918167407160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2112001110200 is a wasteful number, since it uses less digits than its factorization.
2112001110200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257561168 (or 257561159 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2112001110200 its reverse (20111002112), we get a palindrome (2132112112312).
The spelling of 2112001110200 in words is "two trillion, one hundred twelve billion, one million, one hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •