Base | Representation |
---|---|
bin | 110011101110111100… |
… | …1000000000000000000 |
3 | 101121202112101201200100 |
4 | 1213131321000000000 |
5 | 3310011300424334 |
6 | 123012011522400 |
7 | 11012040656400 |
oct | 1473571000000 |
9 | 347675351610 |
10 | 111096889344 |
11 | 43130330331 |
12 | 19646159400 |
13 | a62682ba5c |
14 | 553cb52800 |
15 | 2d53566c99 |
hex | 19dde40000 |
111096889344 has 513 divisors, whose sum is σ = 385777190331. Its totient is φ = 30718033920.
The previous prime is 111096889333. The next prime is 111096889349. The reversal of 111096889344 is 443988690111.
The square root of 111096889344 is 333312.
It is a perfect power (a square), and thus also a powerful number.
It is not an unprimeable number, because it can be changed into a prime (111096889349) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 3583770609 + ... + 3583770639.
Almost surely, 2111096889344 is an apocalyptic number.
111096889344 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
111096889344 is the 333312-nd square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 111096889344
111096889344 is an abundant number, since it is smaller than the sum of its proper divisors (274680300987).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111096889344 is an frugal number, since it uses more digits than its factorization.
111096889344 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118 (or 43 counting only the distinct ones).
The product of its (nonzero) digits is 1492992, while the sum is 54.
The spelling of 111096889344 in words is "one hundred eleven billion, ninety-six million, eight hundred eighty-nine thousand, three hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •