Base | Representation |
---|---|
bin | 111011101100011… |
… | …1010100110110101 |
3 | 12011121000222011211 |
4 | 1313120322212311 |
5 | 13100233121323 |
6 | 530431401421 |
7 | 100431251035 |
oct | 16730724665 |
9 | 5147028154 |
10 | 2003020213 |
11 | 93871a807 |
12 | 47a983271 |
13 | 25bc93c7c |
14 | 1500438c5 |
15 | bacac70d |
hex | 7763a9b5 |
2003020213 has 2 divisors, whose sum is σ = 2003020214. Its totient is φ = 2003020212.
The previous prime is 2003020193. The next prime is 2003020219. The reversal of 2003020213 is 3120203002.
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., 1969761924 + 33258289 = 44382^2 + 5767^2 .
It is a cyclic number.
It is not a de Polignac number, because 2003020213 - 25 = 2003020181 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2003020193 and 2003020202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2003020219) 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, 1001510106 + 1001510107.
It is an arithmetic number, because the mean of its divisors is an integer number (1001510107).
Almost surely, 22003020213 is an apocalyptic number.
It is an amenable number.
2003020213 is a deficient number, since it is larger than the sum of its proper divisors (1).
2003020213 is an equidigital number, since it uses as much as digits as its factorization.
2003020213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 13.
The square root of 2003020213 is about 44755.1138195402. The cubic root of 2003020213 is about 1260.5549359124.
Adding to 2003020213 its reverse (3120203002), we get a palindrome (5123223215).
The spelling of 2003020213 in words is "two billion, three million, twenty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •