Base | Representation |
---|---|
bin | 1011110000100011001… |
… | …1001100011111010001 |
3 | 201022102111112012121201 |
4 | 2330020303030133101 |
5 | 11302204320214022 |
6 | 232445210551201 |
7 | 20411011012426 |
oct | 2741063143721 |
9 | 638374465551 |
10 | 202011101137 |
11 | 7874400025a |
12 | 33199138501 |
13 | 16084b82351 |
14 | 9ac5229d4d |
15 | 53c4ccb127 |
hex | 2f08ccc7d1 |
202011101137 has 2 divisors, whose sum is σ = 202011101138. Its totient is φ = 202011101136.
The previous prime is 202011101113. The next prime is 202011101143. The reversal of 202011101137 is 731101110202.
202011101137 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 201227605056 + 783496081 = 448584^2 + 27991^2 .
It is a cyclic number.
It is not a de Polignac number, because 202011101137 - 219 = 202010576849 is a prime.
It is not a weakly prime, because it can be changed into another prime (202011101147) 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, 101005550568 + 101005550569.
It is an arithmetic number, because the mean of its divisors is an integer number (101005550569).
Almost surely, 2202011101137 is an apocalyptic number.
It is an amenable number.
202011101137 is a deficient number, since it is larger than the sum of its proper divisors (1).
202011101137 is an equidigital number, since it uses as much as digits as its factorization.
202011101137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84, while the sum is 19.
Adding to 202011101137 its reverse (731101110202), we get a palindrome (933112211339).
The spelling of 202011101137 in words is "two hundred two billion, eleven million, one hundred one thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •