Base | Representation |
---|---|
bin | 10100111100010010… |
… | …00001101111100101 |
3 | 1002000112212201022222 |
4 | 22132021001233211 |
5 | 141011213214112 |
6 | 5055350402125 |
7 | 545420532401 |
oct | 123611015745 |
9 | 32015781288 |
10 | 11243101157 |
11 | 484a48a342 |
12 | 2219360345 |
13 | 10a23c2ba2 |
14 | 7892b2101 |
15 | 45c0ae372 |
hex | 29e241be5 |
11243101157 has 2 divisors, whose sum is σ = 11243101158. Its totient is φ = 11243101156.
The previous prime is 11243101141. The next prime is 11243101169. The reversal of 11243101157 is 75110134211.
11243101157 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11144813761 + 98287396 = 105569^2 + 9914^2 .
It is a cyclic number.
It is not a de Polignac number, because 11243101157 - 24 = 11243101141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11243101957) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5621550578 + 5621550579.
It is an arithmetic number, because the mean of its divisors is an integer number (5621550579).
Almost surely, 211243101157 is an apocalyptic number.
It is an amenable number.
11243101157 is a deficient number, since it is larger than the sum of its proper divisors (1).
11243101157 is an equidigital number, since it uses as much as digits as its factorization.
11243101157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 840, while the sum is 26.
Adding to 11243101157 its reverse (75110134211), we get a palindrome (86353235368).
The spelling of 11243101157 in words is "eleven billion, two hundred forty-three million, one hundred one thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •