Base | Representation |
---|---|
bin | 1001001001000001100111… |
… | …01000001010110001011001 |
3 | 2122011200000001221220112211 |
4 | 10210200303220022301121 |
5 | 10113314442124110202 |
6 | 110430225445435121 |
7 | 4143162164204452 |
oct | 444406350126131 |
9 | 78150001856484 |
10 | 20101313113177 |
11 | 644aa1223753a |
12 | 230792910baa1 |
13 | b2a712b7000a |
14 | 4d6ca1854129 |
15 | 24cd345011d7 |
hex | 124833a0ac59 |
20101313113177 has 2 divisors, whose sum is σ = 20101313113178. Its totient is φ = 20101313113176.
The previous prime is 20101313113127. The next prime is 20101313113201. The reversal of 20101313113177 is 77131131310102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15891671982096 + 4209641131081 = 3986436^2 + 2051741^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20101313113177 is a prime.
It is a super-2 number, since 2×201013131131772 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20101313113127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10050656556588 + 10050656556589.
It is an arithmetic number, because the mean of its divisors is an integer number (10050656556589).
Almost surely, 220101313113177 is an apocalyptic number.
It is an amenable number.
20101313113177 is a deficient number, since it is larger than the sum of its proper divisors (1).
20101313113177 is an equidigital number, since it uses as much as digits as its factorization.
20101313113177 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2646, while the sum is 31.
Adding to 20101313113177 its reverse (77131131310102), we get a palindrome (97232444423279).
The spelling of 20101313113177 in words is "twenty trillion, one hundred one billion, three hundred thirteen million, one hundred thirteen thousand, one hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •