Base | Representation |
---|---|
bin | 10100101110111010… |
… | …11001100111011101 |
3 | 1001201201221110020202 |
4 | 22113131121213131 |
5 | 140244014020214 |
6 | 5040303553245 |
7 | 542556643601 |
oct | 122735314735 |
9 | 31651843222 |
10 | 11131001309 |
11 | 47a218403a |
12 | 21a78bb825 |
13 | 1085103b0c |
14 | 778451501 |
15 | 4523196de |
hex | 2977599dd |
11131001309 has 2 divisors, whose sum is σ = 11131001310. Its totient is φ = 11131001308.
The previous prime is 11131001269. The next prime is 11131001351. The reversal of 11131001309 is 90310013111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10832230084 + 298771225 = 104078^2 + 17285^2 .
It is a cyclic number.
It is not a de Polignac number, because 11131001309 - 28 = 11131001053 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 (11131001509) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5565500654 + 5565500655.
It is an arithmetic number, because the mean of its divisors is an integer number (5565500655).
Almost surely, 211131001309 is an apocalyptic number.
It is an amenable number.
11131001309 is a deficient number, since it is larger than the sum of its proper divisors (1).
11131001309 is an equidigital number, since it uses as much as digits as its factorization.
11131001309 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 20.
The spelling of 11131001309 in words is "eleven billion, one hundred thirty-one million, one thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •