Base | Representation |
---|---|
bin | 111011110010010… |
… | …000011011000101 |
3 | 2120220101012210011 |
4 | 323302100123011 |
5 | 4023233431323 |
6 | 243310230221 |
7 | 33566421223 |
oct | 7362203305 |
9 | 2526335704 |
10 | 1003030213 |
11 | 475203499 |
12 | 23bab5371 |
13 | 12ca5b503 |
14 | 972d9b13 |
15 | 5d0ce20d |
hex | 3bc906c5 |
1003030213 has 2 divisors, whose sum is σ = 1003030214. Its totient is φ = 1003030212.
The previous prime is 1003030199. The next prime is 1003030261. The reversal of 1003030213 is 3120303001.
1003030213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 893890404 + 109139809 = 29898^2 + 10447^2 .
It is a cyclic number.
It is not a de Polignac number, because 1003030213 - 221 = 1000933061 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1003030193 and 1003030202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1003030313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 501515106 + 501515107.
It is an arithmetic number, because the mean of its divisors is an integer number (501515107).
Almost surely, 21003030213 is an apocalyptic number.
It is an amenable number.
1003030213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1003030213 is an equidigital number, since it uses as much as digits as its factorization.
1003030213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 13.
The square root of 1003030213 is about 31670.6522351530. The cubic root of 1003030213 is about 1001.0090524706.
Adding to 1003030213 its reverse (3120303001), we get a palindrome (4123333214).
The spelling of 1003030213 in words is "one billion, three million, thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •