Base | Representation |
---|---|
bin | 110011101001101110… |
… | …0010100101110010001 |
3 | 101121022022120002202022 |
4 | 1213103130110232101 |
5 | 3304131412144024 |
6 | 122542350501225 |
7 | 11004512020412 |
oct | 1472334245621 |
9 | 347268502668 |
10 | 110921599889 |
11 | 43050395811 |
12 | 195b7504815 |
13 | a5c9416c99 |
14 | 5523763809 |
15 | 2d42e8e35e |
hex | 19d3714b91 |
110921599889 has 16 divisors (see below), whose sum is σ = 112982625600. Its totient is φ = 108873129024.
The previous prime is 110921599871. The next prime is 110921599907. The reversal of 110921599889 is 988995129011.
It is an interprime number because it is at equal distance from previous prime (110921599871) and next prime (110921599907).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110921599889 is a prime.
It is not an unprimeable number, because it can be changed into a prime (110921599189) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 38024459 + ... + 38027375.
It is an arithmetic number, because the mean of its divisors is an integer number (7061414100).
Almost surely, 2110921599889 is an apocalyptic number.
It is an amenable number.
110921599889 is a deficient number, since it is larger than the sum of its proper divisors (2061025711).
110921599889 is a wasteful number, since it uses less digits than its factorization.
110921599889 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4832.
The product of its (nonzero) digits is 4199040, while the sum is 62.
The spelling of 110921599889 in words is "one hundred ten billion, nine hundred twenty-one million, five hundred ninety-nine thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •