Base | Representation |
---|---|
bin | 10100011111011100… |
… | …00001100100000101 |
3 | 1001101200120220002112 |
4 | 22033232001210011 |
5 | 140012243012014 |
6 | 5015344350405 |
7 | 536422105601 |
oct | 121756014405 |
9 | 31350526075 |
10 | 11001141509 |
11 | 4735948496 |
12 | 2170315405 |
13 | 10642370b7 |
14 | 7650ca501 |
15 | 445c1773e |
hex | 28fb81905 |
11001141509 has 2 divisors, whose sum is σ = 11001141510. Its totient is φ = 11001141508.
The previous prime is 11001141377. The next prime is 11001141539. The reversal of 11001141509 is 90514110011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9613802500 + 1387339009 = 98050^2 + 37247^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11001141509 is a prime.
It is a super-2 number, since 2×110011415092 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11001141539) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500570754 + 5500570755.
It is an arithmetic number, because the mean of its divisors is an integer number (5500570755).
Almost surely, 211001141509 is an apocalyptic number.
It is an amenable number.
11001141509 is a deficient number, since it is larger than the sum of its proper divisors (1).
11001141509 is an equidigital number, since it uses as much as digits as its factorization.
11001141509 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 180, while the sum is 23.
The spelling of 11001141509 in words is "eleven billion, one million, one hundred forty-one thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •