Base | Representation |
---|---|
bin | 1000001100100001… |
… | …1010010010010001 |
3 | 12200022201121020102 |
4 | 2003020122102101 |
5 | 14001201120423 |
6 | 1002150022145 |
7 | 105342601544 |
oct | 20310322221 |
9 | 5608647212 |
10 | 2200020113 |
11 | a29943745 |
12 | 514947955 |
13 | 290a3a865 |
14 | 16c28485b |
15 | cd222c28 |
hex | 8321a491 |
2200020113 has 2 divisors, whose sum is σ = 2200020114. Its totient is φ = 2200020112.
The previous prime is 2200020079. The next prime is 2200020169. The reversal of 2200020113 is 3110200022.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2124103744 + 75916369 = 46088^2 + 8713^2 .
It is a cyclic number.
It is not a de Polignac number, because 2200020113 - 26 = 2200020049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2200020094 and 2200020103.
It is not a weakly prime, because it can be changed into another prime (2200023113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1100010056 + 1100010057.
It is an arithmetic number, because the mean of its divisors is an integer number (1100010057).
Almost surely, 22200020113 is an apocalyptic number.
It is an amenable number.
2200020113 is a deficient number, since it is larger than the sum of its proper divisors (1).
2200020113 is an equidigital number, since it uses as much as digits as its factorization.
2200020113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 11.
The square root of 2200020113 is about 46904.3720030447. The cubic root of 2200020113 is about 1300.5954102932.
Adding to 2200020113 its reverse (3110200022), we get a palindrome (5310220135).
The spelling of 2200020113 in words is "two billion, two hundred million, twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •