Base | Representation |
---|---|
bin | 11001001111010000111010… |
… | …001100010011010010110101 |
3 | 112120000111200121000201200000 |
4 | 121033100322030103102311 |
5 | 104022111211420213414 |
6 | 1032024425211341513 |
7 | 32244331141564536 |
oct | 3117207214232265 |
9 | 476014617021600 |
10 | 111000111101109 |
11 | 32405978a49a8a |
12 | 10548694751899 |
13 | 49c235b5995a9 |
14 | 1d5a61102868d |
15 | cc757aac2b09 |
hex | 64f43a3134b5 |
111000111101109 has 12 divisors (see below), whose sum is σ = 166271771361696. Its totient is φ = 74000074067244.
The previous prime is 111000111101059. The next prime is 111000111101221. The reversal of 111000111101109 is 901101111000111.
It is not a de Polignac number, because 111000111101109 - 27 = 111000111100981 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111000111101091 and 111000111101100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111000111102109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 228395290089 + ... + 228395290574.
It is an arithmetic number, because the mean of its divisors is an integer number (13855980946808).
Almost surely, 2111000111101109 is an apocalyptic number.
It is an amenable number.
111000111101109 is a deficient number, since it is larger than the sum of its proper divisors (55271660260587).
111000111101109 is an frugal number, since it uses more digits than its factorization.
111000111101109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 456790580678 (or 456790580666 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 18.
The spelling of 111000111101109 in words is "one hundred eleven trillion, one hundred eleven million, one hundred one thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •