Base | Representation |
---|---|
bin | 111100101101010… |
… | …0111010101110101 |
3 | 12020222000100010222 |
4 | 1321122213111311 |
5 | 13132434120041 |
6 | 534044224125 |
7 | 101323245611 |
oct | 17132472565 |
9 | 5228010128 |
10 | 2037020021 |
11 | 955932323 |
12 | 48a23b045 |
13 | 2660396ba |
14 | 154774341 |
15 | bdc7674b |
hex | 796a7575 |
2037020021 has 2 divisors, whose sum is σ = 2037020022. Its totient is φ = 2037020020.
The previous prime is 2037019993. The next prime is 2037020023. The reversal of 2037020021 is 1200207302.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1397638225 + 639381796 = 37385^2 + 25286^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2037020021 is a prime.
Together with 2037020023, 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 (2037020023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1018510010 + 1018510011.
It is an arithmetic number, because the mean of its divisors is an integer number (1018510011).
Almost surely, 22037020021 is an apocalyptic number.
It is an amenable number.
2037020021 is a deficient number, since it is larger than the sum of its proper divisors (1).
2037020021 is an equidigital number, since it uses as much as digits as its factorization.
2037020021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 168, while the sum is 17.
The square root of 2037020021 is about 45133.3581843851. The cubic root of 2037020021 is about 1267.6472905432.
Adding to 2037020021 its reverse (1200207302), we get a palindrome (3237227323).
The spelling of 2037020021 in words is "two billion, thirty-seven million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •