Base | Representation |
---|---|
bin | 111011101110111… |
… | …0011000011101101 |
3 | 12011200102222201211 |
4 | 1313131303003231 |
5 | 13101100100023 |
6 | 530515034421 |
7 | 100445161162 |
oct | 16735630355 |
9 | 5150388654 |
10 | 2004300013 |
11 | 9394142a1 |
12 | 47b29ba11 |
13 | 25c321651 |
14 | 150298069 |
15 | bae61a0d |
hex | 777730ed |
2004300013 has 2 divisors, whose sum is σ = 2004300014. Its totient is φ = 2004300012.
The previous prime is 2004299981. The next prime is 2004300029. The reversal of 2004300013 is 3100034002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1299025764 + 705274249 = 36042^2 + 26557^2 .
It is a cyclic number.
It is not a de Polignac number, because 2004300013 - 25 = 2004299981 is a prime.
It is a super-2 number, since 2×20043000132 = 8034437084223600338, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2004299966 and 2004300002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2004300313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1002150006 + 1002150007.
It is an arithmetic number, because the mean of its divisors is an integer number (1002150007).
Almost surely, 22004300013 is an apocalyptic number.
It is an amenable number.
2004300013 is a deficient number, since it is larger than the sum of its proper divisors (1).
2004300013 is an equidigital number, since it uses as much as digits as its factorization.
2004300013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 13.
The square root of 2004300013 is about 44769.4093438812. The cubic root of 2004300013 is about 1260.8233497023.
Adding to 2004300013 its reverse (3100034002), we get a palindrome (5104334015).
The spelling of 2004300013 in words is "two billion, four million, three hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •