Base | Representation |
---|---|
bin | 111011100111011… |
… | …1011011111101101 |
3 | 12011102002222020021 |
4 | 1313032323133231 |
5 | 13044100334123 |
6 | 530255322141 |
7 | 100400066002 |
oct | 16716733755 |
9 | 5142088207 |
10 | 2000402413 |
11 | 9371a1a39 |
12 | 479b20351 |
13 | 25b588589 |
14 | 14d9618a9 |
15 | ba941c5d |
hex | 773bb7ed |
2000402413 has 2 divisors, whose sum is σ = 2000402414. Its totient is φ = 2000402412.
The previous prime is 2000402381. The next prime is 2000402431. The reversal of 2000402413 is 3142040002.
Together with next prime (2000402431) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1979627049 + 20775364 = 44493^2 + 4558^2 .
It is a cyclic number.
It is not a de Polignac number, because 2000402413 - 25 = 2000402381 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2000402473) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1000201206 + 1000201207.
It is an arithmetic number, because the mean of its divisors is an integer number (1000201207).
Almost surely, 22000402413 is an apocalyptic number.
It is an amenable number.
2000402413 is a deficient number, since it is larger than the sum of its proper divisors (1).
2000402413 is an equidigital number, since it uses as much as digits as its factorization.
2000402413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 16.
The square root of 2000402413 is about 44725.8584378210. The cubic root of 2000402413 is about 1260.0055456630.
Adding to 2000402413 its reverse (3142040002), we get a palindrome (5142442415).
The spelling of 2000402413 in words is "two billion, four hundred two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •