Base | Representation |
---|---|
bin | 1001001011111101010111… |
… | …01010000011001100011101 |
3 | 2122112022011212012012120121 |
4 | 10211332223222003030131 |
5 | 10121442410421321112 |
6 | 110544415520514541 |
7 | 4153361101136101 |
oct | 445765352031435 |
9 | 78468155165517 |
10 | 20202111120157 |
11 | 648973807203a |
12 | 232337a17ba51 |
13 | b37087ab5425 |
14 | 4dbb04881901 |
15 | 25078381c407 |
hex | 125faba8331d |
20202111120157 has 2 divisors, whose sum is σ = 20202111120158. Its totient is φ = 20202111120156.
The previous prime is 20202111120017. The next prime is 20202111120161. The reversal of 20202111120157 is 75102111120202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19491350839801 + 710760280356 = 4414901^2 + 843066^2 .
It is a cyclic number.
It is not a de Polignac number, because 20202111120157 - 223 = 20202102731549 is a prime.
It is a super-2 number, since 2×202021111201572 (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 (20202111120757) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10101055560078 + 10101055560079.
It is an arithmetic number, because the mean of its divisors is an integer number (10101055560079).
Almost surely, 220202111120157 is an apocalyptic number.
It is an amenable number.
20202111120157 is a deficient number, since it is larger than the sum of its proper divisors (1).
20202111120157 is an equidigital number, since it uses as much as digits as its factorization.
20202111120157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 560, while the sum is 25.
Adding to 20202111120157 its reverse (75102111120202), we get a palindrome (95304222240359).
The spelling of 20202111120157 in words is "twenty trillion, two hundred two billion, one hundred eleven million, one hundred twenty thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •