Base | Representation |
---|---|
bin | 1001001011111001110110… |
… | …00000010001101000001101 |
3 | 2122112010022010211022012012 |
4 | 10211330323000101220031 |
5 | 10121430023101333122 |
6 | 110543504203351005 |
7 | 4153263211331426 |
oct | 445747300215015 |
9 | 78463263738165 |
10 | 20200221121037 |
11 | 64889582277a1 |
12 | 2322b31222465 |
13 | b36b46373959 |
14 | 4db9a585c64d |
15 | 2506c29377e2 |
hex | 125f3b011a0d |
20200221121037 has 2 divisors, whose sum is σ = 20200221121038. Its totient is φ = 20200221121036.
The previous prime is 20200221120979. The next prime is 20200221121039. The reversal of 20200221121037 is 73012112200202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16721973741001 + 3478247380036 = 4089251^2 + 1865006^2 .
It is a cyclic number.
It is not a de Polignac number, because 20200221121037 - 26 = 20200221120973 is a prime.
Together with 20200221121039, 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 (20200221121039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10100110560518 + 10100110560519.
It is an arithmetic number, because the mean of its divisors is an integer number (10100110560519).
Almost surely, 220200221121037 is an apocalyptic number.
It is an amenable number.
20200221121037 is a deficient number, since it is larger than the sum of its proper divisors (1).
20200221121037 is an equidigital number, since it uses as much as digits as its factorization.
20200221121037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 672, while the sum is 23.
Adding to 20200221121037 its reverse (73012112200202), we get a palindrome (93212333321239).
The spelling of 20200221121037 in words is "twenty trillion, two hundred billion, two hundred twenty-one million, one hundred twenty-one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •