Base | Representation |
---|---|
bin | 111100001101001… |
… | …1100111010110001 |
3 | 12012210100210120102 |
4 | 1320122130322301 |
5 | 13114132400423 |
6 | 532243522145 |
7 | 101030263151 |
oct | 17032347261 |
9 | 5183323512 |
10 | 2020200113 |
11 | 947394278 |
12 | 484689355 |
13 | 2626ca8a9 |
14 | 152436761 |
15 | bc552c28 |
hex | 7869ceb1 |
2020200113 has 2 divisors, whose sum is σ = 2020200114. Its totient is φ = 2020200112.
The previous prime is 2020200097. The next prime is 2020200121. The reversal of 2020200113 is 3110020202.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1089462049 + 930738064 = 33007^2 + 30508^2 .
It is a cyclic number.
It is not a de Polignac number, because 2020200113 - 24 = 2020200097 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2020200094 and 2020200103.
It is not a weakly prime, because it can be changed into another prime (2020200173) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1010100056 + 1010100057.
It is an arithmetic number, because the mean of its divisors is an integer number (1010100057).
Almost surely, 22020200113 is an apocalyptic number.
It is an amenable number.
2020200113 is a deficient number, since it is larger than the sum of its proper divisors (1).
2020200113 is an equidigital number, since it uses as much as digits as its factorization.
2020200113 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 2020200113 is about 44946.6362812614. The cubic root of 2020200113 is about 1264.1486067550.
Adding to 2020200113 its reverse (3110020202), we get a palindrome (5130220315).
The spelling of 2020200113 in words is "two billion, twenty million, two hundred thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •