Base | Representation |
---|---|
bin | 1100001111000100000… |
… | …1000100100100010001 |
3 | 202002120100012000010012 |
4 | 3003301001010210101 |
5 | 11420443204120423 |
6 | 240322050444305 |
7 | 21121000455611 |
oct | 3036101044421 |
9 | 662510160105 |
10 | 210202020113 |
11 | 81167618988 |
12 | 348a4293695 |
13 | 16a8bb20277 |
14 | a260dd0a41 |
15 | 5703e3a078 |
hex | 30f1044911 |
210202020113 has 2 divisors, whose sum is σ = 210202020114. Its totient is φ = 210202020112.
The previous prime is 210202020107. The next prime is 210202020131. The reversal of 210202020113 is 311020202012.
It is a happy number.
Together with next prime (210202020131) 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., 210197491729 + 4528384 = 458473^2 + 2128^2 .
It is a cyclic number.
It is not a de Polignac number, because 210202020113 - 220 = 210200971537 is a prime.
It is not a weakly prime, because it can be changed into another prime (210202020163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105101010056 + 105101010057.
It is an arithmetic number, because the mean of its divisors is an integer number (105101010057).
Almost surely, 2210202020113 is an apocalyptic number.
It is an amenable number.
210202020113 is a deficient number, since it is larger than the sum of its proper divisors (1).
210202020113 is an equidigital number, since it uses as much as digits as its factorization.
210202020113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 210202020113 its reverse (311020202012), we get a palindrome (521222222125).
The spelling of 210202020113 in words is "two hundred ten billion, two hundred two million, twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •