Base | Representation |
---|---|
bin | 1100011000100010… |
… | …0010000010001101 |
3 | 22120122221001200210 |
4 | 3012020202002031 |
5 | 23301434002300 |
6 | 1305503313033 |
7 | 145242412323 |
oct | 30610420215 |
9 | 8518831623 |
10 | 3324125325 |
11 | 1456422614 |
12 | 7892ab779 |
13 | 40c8ab381 |
14 | 237699d13 |
15 | 146c6b050 |
hex | c622208d |
3324125325 has 48 divisors (see below), whose sum is σ = 5682521216. Its totient is φ = 1713312000.
The previous prime is 3324125323. The next prime is 3324125333. The reversal of 3324125325 is 5235214233.
It is not a de Polignac number, because 3324125325 - 21 = 3324125323 is a prime.
It is a super-2 number, since 2×33241253252 = 22099618352612711250, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3324125292 and 3324125301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3324125323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 415059 + ... + 422991.
Almost surely, 23324125325 is an apocalyptic number.
It is an amenable number.
3324125325 is a deficient number, since it is larger than the sum of its proper divisors (2358395891).
3324125325 is a wasteful number, since it uses less digits than its factorization.
3324125325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8134 (or 8129 counting only the distinct ones).
The product of its digits is 21600, while the sum is 30.
The square root of 3324125325 is about 57655.2280803745. The cubic root of 3324125325 is about 1492.4248199409.
Adding to 3324125325 its reverse (5235214233), we get a palindrome (8559339558).
The spelling of 3324125325 in words is "three billion, three hundred twenty-four million, one hundred twenty-five thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •