Base | Representation |
---|---|
bin | 10000001010110011000… |
… | …110100110000101011001 |
3 | 10221012221220202000000021 |
4 | 100022303012212011121 |
5 | 121201021220203024 |
6 | 2210234002310441 |
7 | 143163152452024 |
oct | 20126306460531 |
9 | 3835856660007 |
10 | 1111106412889 |
11 | 399243670420 |
12 | 15b40b358421 |
13 | 80a13a80315 |
14 | 3bac65581bb |
15 | 1dd80a5ede4 |
hex | 102b31a6159 |
1111106412889 has 32 divisors (see below), whose sum is σ = 1240375449600. Its totient is φ = 986854492800.
The previous prime is 1111106412863. The next prime is 1111106412901. The reversal of 1111106412889 is 9882146011111.
It is not a de Polignac number, because 1111106412889 - 27 = 1111106412761 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1111106412809) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 36258604 + ... + 36289234.
It is an arithmetic number, because the mean of its divisors is an integer number (38761732800).
Almost surely, 21111106412889 is an apocalyptic number.
It is an amenable number.
1111106412889 is a deficient number, since it is larger than the sum of its proper divisors (129269036711).
1111106412889 is a wasteful number, since it uses less digits than its factorization.
1111106412889 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31141.
The product of its (nonzero) digits is 27648, while the sum is 43.
The spelling of 1111106412889 in words is "one trillion, one hundred eleven billion, one hundred six million, four hundred twelve thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •