Base | Representation |
---|---|
bin | 10100100001101101… |
… | …00100101111000001 |
3 | 1001110000101010110202 |
4 | 22100312210233001 |
5 | 140032130104222 |
6 | 5021304134545 |
7 | 540042546113 |
oct | 122066445701 |
9 | 31400333422 |
10 | 11020159937 |
11 | 47456582a6 |
12 | 2176767455 |
13 | 10681657c7 |
14 | 76783b3b3 |
15 | 447722892 |
hex | 290da4bc1 |
11020159937 has 2 divisors, whose sum is σ = 11020159938. Its totient is φ = 11020159936.
The previous prime is 11020159921. The next prime is 11020159973. The reversal of 11020159937 is 73995102011.
Together with next prime (11020159973) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10403184016 + 616975921 = 101996^2 + 24839^2 .
It is a cyclic number.
It is not a de Polignac number, because 11020159937 - 24 = 11020159921 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11020159937.
It is not a weakly prime, because it can be changed into another prime (11020159637) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510079968 + 5510079969.
It is an arithmetic number, because the mean of its divisors is an integer number (5510079969).
Almost surely, 211020159937 is an apocalyptic number.
It is an amenable number.
11020159937 is a deficient number, since it is larger than the sum of its proper divisors (1).
11020159937 is an equidigital number, since it uses as much as digits as its factorization.
11020159937 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17010, while the sum is 38.
The spelling of 11020159937 in words is "eleven billion, twenty million, one hundred fifty-nine thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •