Base | Representation |
---|---|
bin | 11001001111010001001011… |
… | …101011010011110000000000 |
3 | 112120000112110000222222212121 |
4 | 121033101023223103300000 |
5 | 104022112312014121422 |
6 | 1032024514250534024 |
7 | 32244341333131243 |
oct | 3117211353236000 |
9 | 476015400888777 |
10 | 111000404442112 |
11 | 32406009595469 |
12 | 10548756a37314 |
13 | 49c23a72a5453 |
14 | 1d5a63bd8725a |
15 | cc75967188c7 |
hex | 64f44bad3c00 |
111000404442112 has 176 divisors, whose sum is σ = 223757047605600. Its totient is φ = 55036335882240.
The previous prime is 111000404442071. The next prime is 111000404442113. The reversal of 111000404442112 is 211244404000111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111000404442113) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 93043087788 + ... + 93043088980.
Almost surely, 2111000404442112 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 111000404442112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (111878523802800).
111000404442112 is an abundant number, since it is smaller than the sum of its proper divisors (112756643163488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111000404442112 is a wasteful number, since it uses less digits than its factorization.
111000404442112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2702 (or 2684 counting only the distinct ones).
The product of its (nonzero) digits is 1024, while the sum is 25.
Adding to 111000404442112 its reverse (211244404000111), we get a palindrome (322244808442223).
The spelling of 111000404442112 in words is "one hundred eleven trillion, four hundred four million, four hundred forty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •