Base | Representation |
---|---|
bin | 1001001011111001100001… |
… | …11110111111101011110101 |
3 | 2122112002212102111112122101 |
4 | 10211330300332333223311 |
5 | 10121424202032410422 |
6 | 110543435400302101 |
7 | 4153256100413266 |
oct | 445746076775365 |
9 | 78462772445571 |
10 | 20200053013237 |
11 | 6488881347929 |
12 | 2322aa4a71931 |
13 | b36b1a5a4996 |
14 | 4db98b3bc96d |
15 | 2506b2cccc27 |
hex | 125f30fbfaf5 |
20200053013237 has 2 divisors, whose sum is σ = 20200053013238. Its totient is φ = 20200053013236.
The previous prime is 20200053013169. The next prime is 20200053013303. The reversal of 20200053013237 is 73231035000202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17285978684881 + 2914074328356 = 4157641^2 + 1707066^2 .
It is a cyclic number.
It is not a de Polignac number, because 20200053013237 - 211 = 20200053011189 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20200053013837) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10100026506618 + 10100026506619.
It is an arithmetic number, because the mean of its divisors is an integer number (10100026506619).
Almost surely, 220200053013237 is an apocalyptic number.
It is an amenable number.
20200053013237 is a deficient number, since it is larger than the sum of its proper divisors (1).
20200053013237 is an equidigital number, since it uses as much as digits as its factorization.
20200053013237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7560, while the sum is 28.
Adding to 20200053013237 its reverse (73231035000202), we get a palindrome (93431088013439).
The spelling of 20200053013237 in words is "twenty trillion, two hundred billion, fifty-three million, thirteen thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •