Base | Representation |
---|---|
bin | 1000010110000110… |
… | …1100000100111101 |
3 | 12210010100000002012 |
4 | 2011201230010331 |
5 | 14041442413041 |
6 | 1010143141005 |
7 | 106341252212 |
oct | 20541540475 |
9 | 5703300065 |
10 | 2240201021 |
11 | a4a598203 |
12 | 5262a4765 |
13 | 299168846 |
14 | 173743b09 |
15 | d1a0d3eb |
hex | 8586c13d |
2240201021 has 2 divisors, whose sum is σ = 2240201022. Its totient is φ = 2240201020.
The previous prime is 2240201011. The next prime is 2240201039. The reversal of 2240201021 is 1201020422.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2105524996 + 134676025 = 45886^2 + 11605^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2240201021 is a prime.
It is a super-2 number, since 2×22402010212 = 10037001228978884882, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2240200987 and 2240201005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2240201011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1120100510 + 1120100511.
It is an arithmetic number, because the mean of its divisors is an integer number (1120100511).
Almost surely, 22240201021 is an apocalyptic number.
It is an amenable number.
2240201021 is a deficient number, since it is larger than the sum of its proper divisors (1).
2240201021 is an equidigital number, since it uses as much as digits as its factorization.
2240201021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 14.
The square root of 2240201021 is about 47330.7618890717. The cubic root of 2240201021 is about 1308.4656629654.
Adding to 2240201021 its reverse (1201020422), we get a palindrome (3441221443).
The spelling of 2240201021 in words is "two billion, two hundred forty million, two hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •