Base | Representation |
---|---|
bin | 11110101111000000000… |
… | …000001010101001101000 |
3 | 21110220120102002100200220 |
4 | 132233000000022221220 |
5 | 234100434323231212 |
6 | 4254132405530040 |
7 | 305406400405230 |
oct | 36570000125150 |
9 | 7426512070626 |
10 | 2112050211432 |
11 | 744796313107 |
12 | 2a13b5413920 |
13 | 12421c739025 |
14 | 7431c07ccc0 |
15 | 39e150a538c |
hex | 1ebc000aa68 |
2112050211432 has 128 divisors (see below), whose sum is σ = 6096902434560. Its totient is φ = 597200947200.
The previous prime is 2112050211419. The next prime is 2112050211539. The reversal of 2112050211432 is 2341120502112.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 39559668 + ... + 39613020.
It is an arithmetic number, because the mean of its divisors is an integer number (47632050270).
Almost surely, 22112050211432 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2112050211432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3048451217280).
2112050211432 is an abundant number, since it is smaller than the sum of its proper divisors (3984852223128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2112050211432 is a wasteful number, since it uses less digits than its factorization.
2112050211432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55803 (or 55799 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 24.
Adding to 2112050211432 its reverse (2341120502112), we get a palindrome (4453170713544).
The spelling of 2112050211432 in words is "two trillion, one hundred twelve billion, fifty million, two hundred eleven thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •