Base | Representation |
---|---|
bin | 10100100001101100… |
… | …00010110011001001 |
3 | 1001110000010001210121 |
4 | 22100312002303021 |
5 | 140032111132222 |
6 | 5021301143241 |
7 | 540041426632 |
oct | 122066026311 |
9 | 31400101717 |
10 | 11020020937 |
11 | 4745572922 |
12 | 21766bab21 |
13 | 1068117463 |
14 | 767802889 |
15 | 4476e65c7 |
hex | 290d82cc9 |
11020020937 has 2 divisors, whose sum is σ = 11020020938. Its totient is φ = 11020020936.
The previous prime is 11020020931. The next prime is 11020020953. The reversal of 11020020937 is 73902002011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10452199696 + 567821241 = 102236^2 + 23829^2 .
It is an emirp because it is prime and its reverse (73902002011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11020020937 - 215 = 11019988169 is a prime.
It is a super-2 number, since 2×110200209372 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11020020931) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510010468 + 5510010469.
It is an arithmetic number, because the mean of its divisors is an integer number (5510010469).
Almost surely, 211020020937 is an apocalyptic number.
It is an amenable number.
11020020937 is a deficient number, since it is larger than the sum of its proper divisors (1).
11020020937 is an equidigital number, since it uses as much as digits as its factorization.
11020020937 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 756, while the sum is 25.
Adding to 11020020937 its reverse (73902002011), we get a palindrome (84922022948).
The spelling of 11020020937 in words is "eleven billion, twenty million, twenty thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •