Base | Representation |
---|---|
bin | 11101000110101111111… |
… | …110001101000111111000 |
3 | 21002012122020210201212211 |
4 | 131012233332031013320 |
5 | 230232212200041440 |
6 | 4130501103544504 |
7 | 264334433304403 |
oct | 35065776150770 |
9 | 7065566721784 |
10 | 2000112112120 |
11 | 701274165331 |
12 | 2837755bb134 |
13 | 1167c0858bc5 |
14 | 6cb3d714d3a |
15 | 37062c75eea |
hex | 1d1aff8d1f8 |
2000112112120 has 32 divisors (see below), whose sum is σ = 4502710228320. Its totient is φ = 799607871360.
The previous prime is 2000112112079. The next prime is 2000112112139. The reversal of 2000112112120 is 212112110002.
It is a super-2 number, since 2×20001121121202 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2000112112120.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13581267 + ... + 13727746.
It is an arithmetic number, because the mean of its divisors is an integer number (140709694635).
Almost surely, 22000112112120 is an apocalyptic number.
2000112112120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2000112112120 is an abundant number, since it is smaller than the sum of its proper divisors (2502598116200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000112112120 is a wasteful number, since it uses less digits than its factorization.
2000112112120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27310855 (or 27310851 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2000112112120 its reverse (212112110002), we get a palindrome (2212224222122).
The spelling of 2000112112120 in words is "two trillion, one hundred twelve million, one hundred twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •