Base | Representation |
---|---|
bin | 10101000010000000… |
… | …10000000011111111 |
3 | 1002010220020221110222 |
4 | 22201000100003333 |
5 | 141111012212114 |
6 | 5104224051555 |
7 | 546543016436 |
oct | 124100200377 |
9 | 32126227428 |
10 | 11291132159 |
11 | 487460578a |
12 | 2231463bbb |
13 | 10ac33bcb8 |
14 | 79181611d |
15 | 4613ea98e |
hex | 2a10100ff |
11291132159 has 2 divisors, whose sum is σ = 11291132160. Its totient is φ = 11291132158.
The previous prime is 11291132143. The next prime is 11291132173. The reversal of 11291132159 is 95123119211.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11291132159 - 24 = 11291132143 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11291132189) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5645566079 + 5645566080.
It is an arithmetic number, because the mean of its divisors is an integer number (5645566080).
Almost surely, 211291132159 is an apocalyptic number.
11291132159 is a deficient number, since it is larger than the sum of its proper divisors (1).
11291132159 is an equidigital number, since it uses as much as digits as its factorization.
11291132159 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4860, while the sum is 35.
The spelling of 11291132159 in words is "eleven billion, two hundred ninety-one million, one hundred thirty-two thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •