Base | Representation |
---|---|
bin | 10100011111011011… |
… | …11001101001110101 |
3 | 1001101200112020122112 |
4 | 22033231321221311 |
5 | 140012240442414 |
6 | 5015343540405 |
7 | 536421612254 |
oct | 121755715165 |
9 | 31350466575 |
10 | 11001109109 |
11 | 4735926111 |
12 | 21702ba705 |
13 | 1064225423 |
14 | 7650bc79b |
15 | 445c0cd3e |
hex | 28fb79a75 |
11001109109 has 2 divisors, whose sum is σ = 11001109110. Its totient is φ = 11001109108.
The previous prime is 11001109087. The next prime is 11001109123. The reversal of 11001109109 is 90190110011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5617952209 + 5383156900 = 74953^2 + 73370^2 .
It is an emirp because it is prime and its reverse (90190110011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11001109109 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11001109169) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500554554 + 5500554555.
It is an arithmetic number, because the mean of its divisors is an integer number (5500554555).
Almost surely, 211001109109 is an apocalyptic number.
It is an amenable number.
11001109109 is a deficient number, since it is larger than the sum of its proper divisors (1).
11001109109 is an equidigital number, since it uses as much as digits as its factorization.
11001109109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81, while the sum is 23.
The spelling of 11001109109 in words is "eleven billion, one million, one hundred nine thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.608 sec. • engine limits •