Base | Representation |
---|---|
bin | 10100101100010011… |
… | …11001010011011001 |
3 | 1001200012202022101121 |
4 | 22112021321103121 |
5 | 140222413023001 |
6 | 5034202445241 |
7 | 542202612502 |
oct | 122611712331 |
9 | 31605668347 |
10 | 11109111001 |
11 | 479089257a |
12 | 21a0503821 |
13 | 108070b181 |
14 | 775593ba9 |
15 | 4504436a1 |
hex | 2962794d9 |
11109111001 has 2 divisors, whose sum is σ = 11109111002. Its totient is φ = 11109111000.
The previous prime is 11109110993. The next prime is 11109111011. The reversal of 11109111001 is 10011190111.
11109111001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11096515600 + 12595401 = 105340^2 + 3549^2 .
It is a cyclic number.
It is not a de Polignac number, because 11109111001 - 23 = 11109110993 is a prime.
It is not a weakly prime, because it can be changed into another prime (11109111011) 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 as a sum of consecutive naturals, namely, 5554555500 + 5554555501.
It is an arithmetic number, because the mean of its divisors is an integer number (5554555501).
Almost surely, 211109111001 is an apocalyptic number.
It is an amenable number.
11109111001 is a deficient number, since it is larger than the sum of its proper divisors (1).
11109111001 is an equidigital number, since it uses as much as digits as its factorization.
11109111001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9, while the sum is 16.
The spelling of 11109111001 in words is "eleven billion, one hundred nine million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •