Base | Representation |
---|---|
bin | 10100101000010100… |
… | …00101101001011011 |
3 | 1001120212201010201112 |
4 | 22110022011221123 |
5 | 140140323412011 |
6 | 5031004410535 |
7 | 541315051541 |
oct | 122412055133 |
9 | 31525633645 |
10 | 11075607131 |
11 | 4773989626 |
12 | 2191246a4b |
13 | 10767aa3b4 |
14 | 770d51d91 |
15 | 44c52658b |
hex | 294285a5b |
11075607131 has 2 divisors, whose sum is σ = 11075607132. Its totient is φ = 11075607130.
The previous prime is 11075607113. The next prime is 11075607139. The reversal of 11075607131 is 13170657011.
Together with previous prime (11075607113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11075607131 - 210 = 11075606107 is a prime.
It is a super-2 number, since 2×110756071312 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11075607139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5537803565 + 5537803566.
It is an arithmetic number, because the mean of its divisors is an integer number (5537803566).
Almost surely, 211075607131 is an apocalyptic number.
11075607131 is a deficient number, since it is larger than the sum of its proper divisors (1).
11075607131 is an equidigital number, since it uses as much as digits as its factorization.
11075607131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4410, while the sum is 32.
The spelling of 11075607131 in words is "eleven billion, seventy-five million, six hundred seven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •