Base | Representation |
---|---|
bin | 1011001011101110… |
… | …1110001101010101 |
3 | 21202012210102010002 |
4 | 2302323232031111 |
5 | 22122003001323 |
6 | 1213515141045 |
7 | 134251403132 |
oct | 26273561525 |
9 | 7665712102 |
10 | 3002000213 |
11 | 1300607213 |
12 | 6b9444785 |
13 | 38ac34ab4 |
14 | 2069a7589 |
15 | 12883b828 |
hex | b2eee355 |
3002000213 has 2 divisors, whose sum is σ = 3002000214. Its totient is φ = 3002000212.
The previous prime is 3002000201. The next prime is 3002000257. The reversal of 3002000213 is 3120002003.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2879610244 + 122389969 = 53662^2 + 11063^2 .
It is a cyclic number.
It is not a de Polignac number, because 3002000213 - 212 = 3001996117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3002000194 and 3002000203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3002000263) 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, 1501000106 + 1501000107.
It is an arithmetic number, because the mean of its divisors is an integer number (1501000107).
Almost surely, 23002000213 is an apocalyptic number.
It is an amenable number.
3002000213 is a deficient number, since it is larger than the sum of its proper divisors (1).
3002000213 is an equidigital number, since it uses as much as digits as its factorization.
3002000213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 11.
The square root of 3002000213 is about 54790.5120709781. The cubic root of 3002000213 is about 1442.5700331342.
Adding to 3002000213 its reverse (3120002003), we get a palindrome (6122002216).
The spelling of 3002000213 in words is "three billion, two million, two hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •