Base | Representation |
---|---|
bin | 1100011100010100… |
… | …1000001110101101 |
3 | 22121202211002221101 |
4 | 3013011020032231 |
5 | 23320020313123 |
6 | 1311232003101 |
7 | 145524422455 |
oct | 30705101655 |
9 | 8552732841 |
10 | 3340010413 |
11 | 1464392293 |
12 | 792690491 |
13 | 412c8082c |
14 | 239832d65 |
15 | 148357aad |
hex | c71483ad |
3340010413 has 2 divisors, whose sum is σ = 3340010414. Its totient is φ = 3340010412.
The previous prime is 3340010407. The next prime is 3340010441. The reversal of 3340010413 is 3140100433.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3281227524 + 58782889 = 57282^2 + 7667^2 .
It is an emirp because it is prime and its reverse (3140100433) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3340010413 - 25 = 3340010381 is a prime.
It is a super-2 number, since 2×33400104132 = 22311339117896861138, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3340017413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1670005206 + 1670005207.
It is an arithmetic number, because the mean of its divisors is an integer number (1670005207).
Almost surely, 23340010413 is an apocalyptic number.
It is an amenable number.
3340010413 is a deficient number, since it is larger than the sum of its proper divisors (1).
3340010413 is an equidigital number, since it uses as much as digits as its factorization.
3340010413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 19.
The square root of 3340010413 is about 57792.8231963105. The cubic root of 3340010413 is about 1494.7983401555.
Adding to 3340010413 its reverse (3140100433), we get a palindrome (6480110846).
The spelling of 3340010413 in words is "three billion, three hundred forty million, ten thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •