Base | Representation |
---|---|
bin | 1010000000010010111110… |
… | …1011100101110010000101 |
3 | 1102221121110122001210211111 |
4 | 2200010233223211302011 |
5 | 2420211413031414112 |
6 | 35221232142205021 |
7 | 2213511326312203 |
oct | 240045753456205 |
9 | 42847418053744 |
10 | 11000211201157 |
11 | 35611884a2522 |
12 | 1297ab8583771 |
13 | 61a414100859 |
14 | 2a05ad632073 |
15 | 141219ec75a7 |
hex | a012fae5c85 |
11000211201157 has 2 divisors, whose sum is σ = 11000211201158. Its totient is φ = 11000211201156.
The previous prime is 11000211201121. The next prime is 11000211201163. The reversal of 11000211201157 is 75110211200011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7141288837761 + 3858922363396 = 2672319^2 + 1964414^2 .
It is a cyclic number.
It is not a de Polignac number, because 11000211201157 - 215 = 11000211168389 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11000211241157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500105600578 + 5500105600579.
It is an arithmetic number, because the mean of its divisors is an integer number (5500105600579).
Almost surely, 211000211201157 is an apocalyptic number.
It is an amenable number.
11000211201157 is a deficient number, since it is larger than the sum of its proper divisors (1).
11000211201157 is an equidigital number, since it uses as much as digits as its factorization.
11000211201157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 140, while the sum is 22.
Adding to 11000211201157 its reverse (75110211200011), we get a palindrome (86110422401168).
The spelling of 11000211201157 in words is "eleven trillion, two hundred eleven million, two hundred one thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •