Base | Representation |
---|---|
bin | 1100000100100100… |
… | …1011110111101101 |
3 | 22100211101220200121 |
4 | 3001021023313231 |
5 | 23114021114410 |
6 | 1253313124541 |
7 | 143205015145 |
oct | 30111136755 |
9 | 8324356617 |
10 | 3240410605 |
11 | 14131444a3 |
12 | 765259751 |
13 | 3c844a233 |
14 | 22a507925 |
15 | 13e7319da |
hex | c124bded |
3240410605 has 16 divisors (see below), whose sum is σ = 4091001264. Its totient is φ = 2460741120.
The previous prime is 3240410603. The next prime is 3240410611. The reversal of 3240410605 is 5060140423.
It can be written as a sum of positive squares in 8 ways, for example, as 253350889 + 2987059716 = 15917^2 + 54654^2 .
It is not a de Polignac number, because 3240410605 - 21 = 3240410603 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3240410605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3240410603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 206022 + ... + 221191.
It is an arithmetic number, because the mean of its divisors is an integer number (255687579).
Almost surely, 23240410605 is an apocalyptic number.
It is an amenable number.
3240410605 is a deficient number, since it is larger than the sum of its proper divisors (850590659).
3240410605 is a wasteful number, since it uses less digits than its factorization.
3240410605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 427296.
The product of its (nonzero) digits is 2880, while the sum is 25.
The square root of 3240410605 is about 56924.6045660398. The cubic root of 3240410605 is about 1479.7897505387.
The spelling of 3240410605 in words is "three billion, two hundred forty million, four hundred ten thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •