Base | Representation |
---|---|
bin | 11110101110001101011… |
… | …000110011011101000000 |
3 | 21110211101020012120111211 |
4 | 132232031120303131000 |
5 | 234042214431011000 |
6 | 4253512233015504 |
7 | 305346346452364 |
oct | 36561530633500 |
9 | 7424336176454 |
10 | 2111201032000 |
11 | 74439aa42025 |
12 | 2a11b8b54594 |
13 | 1241158273a8 |
14 | 7427b3912a4 |
15 | 39db57667ba |
hex | 1eb8d633740 |
2111201032000 has 224 divisors, whose sum is σ = 5541162172416. Its totient is φ = 794055680000.
The previous prime is 2111201031959. The next prime is 2111201032009. The reversal of 2111201032000 is 2301021112.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2111201032009) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 156529257 + ... + 156542743.
Almost surely, 22111201032000 is an apocalyptic number.
2111201032000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2111201032000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2770581086208).
2111201032000 is an abundant number, since it is smaller than the sum of its proper divisors (3429961140416).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2111201032000 is a wasteful number, since it uses less digits than its factorization.
2111201032000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14682 (or 14662 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 2111201032000 its reverse (2301021112), we get a palindrome (2113502053112).
The spelling of 2111201032000 in words is "two trillion, one hundred eleven billion, two hundred one million, thirty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •