Base | Representation |
---|---|
bin | 1100000101000100… |
… | …1101100000110101 |
3 | 22100222100210200002 |
4 | 3001101031200311 |
5 | 23120040430420 |
6 | 1253430201045 |
7 | 143231630000 |
oct | 30121154065 |
9 | 8328323602 |
10 | 3242514485 |
11 | 1414351141 |
12 | 765ab3185 |
13 | 3c8a05a32 |
14 | 22a8d4537 |
15 | 13e9ea075 |
hex | c144d835 |
3242514485 has 20 divisors (see below), whose sum is σ = 4539266988. Its totient is φ = 2223430272.
The previous prime is 3242514467. The next prime is 3242514503. The reversal of 3242514485 is 5844152423.
It is an interprime number because it is at equal distance from previous prime (3242514467) and next prime (3242514503).
It can be written as a sum of positive squares in 2 ways, for example, as 1544332804 + 1698181681 = 39298^2 + 41209^2 .
It is not a de Polignac number, because 3242514485 - 28 = 3242514229 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 123044 + ... + 147053.
Almost surely, 23242514485 is an apocalyptic number.
3242514485 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
3242514485 is a deficient number, since it is larger than the sum of its proper divisors (1296752503).
3242514485 is an frugal number, since it uses more digits than its factorization.
3242514485 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 270130 (or 270109 counting only the distinct ones).
The product of its digits is 153600, while the sum is 38.
The square root of 3242514485 is about 56943.0810985848. The cubic root of 3242514485 is about 1480.1099390270.
The spelling of 3242514485 in words is "three billion, two hundred forty-two million, five hundred fourteen thousand, four hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •