Base | Representation |
---|---|
bin | 1010001011111111000001… |
… | …1010110100001101110011 |
3 | 1110122210202212122110000101 |
4 | 2202333300122310031303 |
5 | 2432004133401132011 |
6 | 35453401404133231 |
7 | 2234150360103052 |
oct | 242776032641563 |
9 | 43583685573011 |
10 | 11201013302131 |
11 | 3629360aa9a94 |
12 | 130a9b8837217 |
13 | 633335659c93 |
14 | 2aa1bc068399 |
15 | 14656da8b2c1 |
hex | a2ff06b4373 |
11201013302131 has 2 divisors, whose sum is σ = 11201013302132. Its totient is φ = 11201013302130.
The previous prime is 11201013302117. The next prime is 11201013302177. The reversal of 11201013302131 is 13120331010211.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11201013302131 - 229 = 11200476431219 is a prime.
It is a super-2 number, since 2×112010133021312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11201013302099 and 11201013302108.
It is not a weakly prime, because it can be changed into another prime (11201013302111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5600506651065 + 5600506651066.
It is an arithmetic number, because the mean of its divisors is an integer number (5600506651066).
Almost surely, 211201013302131 is an apocalyptic number.
11201013302131 is a deficient number, since it is larger than the sum of its proper divisors (1).
11201013302131 is an equidigital number, since it uses as much as digits as its factorization.
11201013302131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 11201013302131 its reverse (13120331010211), we get a palindrome (24321344312342).
The spelling of 11201013302131 in words is "eleven trillion, two hundred one billion, thirteen million, three hundred two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •