Base | Representation |
---|---|
bin | 1001001011111001100111… |
… | …10101011110100110011101 |
3 | 2122112002222202111220110012 |
4 | 10211330303311132212131 |
5 | 10121424301304200302 |
6 | 110543444225453005 |
7 | 4153260221131301 |
oct | 445746365364635 |
9 | 78462882456405 |
10 | 20200100850077 |
11 | 64888a6350405 |
12 | 2322ab8aa1165 |
13 | b36b274835c5 |
14 | 4db9938b1d01 |
15 | 2506b70cba52 |
hex | 125f33d5e99d |
20200100850077 has 2 divisors, whose sum is σ = 20200100850078. Its totient is φ = 20200100850076.
The previous prime is 20200100850047. The next prime is 20200100850079. The reversal of 20200100850077 is 77005800100202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18168147532921 + 2031953317156 = 4262411^2 + 1425466^2 .
It is a cyclic number.
It is not a de Polignac number, because 20200100850077 - 226 = 20200033741213 is a prime.
Together with 20200100850079, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20200100850079) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10100050425038 + 10100050425039.
It is an arithmetic number, because the mean of its divisors is an integer number (10100050425039).
Almost surely, 220200100850077 is an apocalyptic number.
It is an amenable number.
20200100850077 is a deficient number, since it is larger than the sum of its proper divisors (1).
20200100850077 is an equidigital number, since it uses as much as digits as its factorization.
20200100850077 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7840, while the sum is 32.
Adding to 20200100850077 its reverse (77005800100202), we get a palindrome (97205900950279).
The spelling of 20200100850077 in words is "twenty trillion, two hundred billion, one hundred million, eight hundred fifty thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •