Base | Representation |
---|---|
bin | 1010001011111111110000… |
… | …1001100010110110100101 |
3 | 1110122211021120221212112012 |
4 | 2202333330021202312211 |
5 | 2432010034241214112 |
6 | 35453433114204005 |
7 | 2234155266626126 |
oct | 242777411426645 |
9 | 43584246855465 |
10 | 11201210101157 |
11 | 36294520a600a |
12 | 130aa52723605 |
13 | 6333673632cb |
14 | 2aa1da25604d |
15 | 146580eb2022 |
hex | a2ffc262da5 |
11201210101157 has 2 divisors, whose sum is σ = 11201210101158. Its totient is φ = 11201210101156.
The previous prime is 11201210101073. The next prime is 11201210101163. The reversal of 11201210101157 is 75110101210211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6506993876161 + 4694216224996 = 2550881^2 + 2166614^2 .
It is a cyclic number.
It is not a de Polignac number, because 11201210101157 - 210 = 11201210100133 is a prime.
It is a super-2 number, since 2×112012101011572 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11201210181157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5600605050578 + 5600605050579.
It is an arithmetic number, because the mean of its divisors is an integer number (5600605050579).
Almost surely, 211201210101157 is an apocalyptic number.
It is an amenable number.
11201210101157 is a deficient number, since it is larger than the sum of its proper divisors (1).
11201210101157 is an equidigital number, since it uses as much as digits as its factorization.
11201210101157 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 23.
Adding to 11201210101157 its reverse (75110101210211), we get a palindrome (86311311311368).
The spelling of 11201210101157 in words is "eleven trillion, two hundred one billion, two hundred ten million, one hundred one thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •