Base | Representation |
---|---|
bin | 100000110100001… |
… | …1001111101000101 |
3 | 2211201221020110221 |
4 | 1001220121331011 |
5 | 4223341023414 |
6 | 301132344341 |
7 | 36200201320 |
oct | 10150317505 |
9 | 2751836427 |
10 | 1101111109 |
11 | 51560408a |
12 | 2689150b1 |
13 | 14717c647 |
14 | a634b7b7 |
15 | 66a05224 |
hex | 41a19f45 |
1101111109 has 4 divisors (see below), whose sum is σ = 1258412704. Its totient is φ = 943809516.
The previous prime is 1101111107. The next prime is 1101111149. The reversal of 1101111109 is 9011111011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 9011111011 = 7 ⋅1287301573.
It is a cyclic number.
It is not a de Polignac number, because 1101111109 - 21 = 1101111107 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1101111092 and 1101111101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101111107) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 78650787 + ... + 78650800.
It is an arithmetic number, because the mean of its divisors is an integer number (314603176).
Almost surely, 21101111109 is an apocalyptic number.
It is an amenable number.
1101111109 is a deficient number, since it is larger than the sum of its proper divisors (157301595).
1101111109 is an equidigital number, since it uses as much as digits as its factorization.
1101111109 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 157301594.
The product of its (nonzero) digits is 9, while the sum is 16.
The square root of 1101111109 is about 33182.9942741760. The cubic root of 1101111109 is about 1032.6275668979.
The spelling of 1101111109 in words is "one billion, one hundred one million, one hundred eleven thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •