Base | Representation |
---|---|
bin | 1010000000010101111010… |
… | …1100100111111010000101 |
3 | 1102221200111121100000000022 |
4 | 2200011132230213322011 |
5 | 2420220022000014112 |
6 | 35221442321024525 |
7 | 2213540015100515 |
oct | 240053654477205 |
9 | 42850447300008 |
10 | 11001000001157 |
11 | 3561552783651 |
12 | 1298098785145 |
13 | 61a50b66190a |
14 | 2a06462c3845 |
15 | 14126438ad72 |
hex | a015eb27e85 |
11001000001157 has 2 divisors, whose sum is σ = 11001000001158. Its totient is φ = 11001000001156.
The previous prime is 11001000001127. The next prime is 11001000001181. The reversal of 11001000001157 is 75110000010011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9296163179521 + 1704836821636 = 3048961^2 + 1305694^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11001000001157 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11001000001127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500500000578 + 5500500000579.
It is an arithmetic number, because the mean of its divisors is an integer number (5500500000579).
Almost surely, 211001000001157 is an apocalyptic number.
It is an amenable number.
11001000001157 is a deficient number, since it is larger than the sum of its proper divisors (1).
11001000001157 is an equidigital number, since it uses as much as digits as its factorization.
11001000001157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 35, while the sum is 17.
Adding to 11001000001157 its reverse (75110000010011), we get a palindrome (86111000011168).
The spelling of 11001000001157 in words is "eleven trillion, one billion, one thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •