Base | Representation |
---|---|
bin | 1100011000100101… |
… | …0001101001001010 |
3 | 22120200021222012012 |
4 | 3012021101221022 |
5 | 23302011222310 |
6 | 1305511415522 |
7 | 145244154002 |
oct | 30611215112 |
9 | 8520258165 |
10 | 3324320330 |
11 | 1456546081 |
12 | 7893845a2 |
13 | 40c949066 |
14 | 23770b002 |
15 | 146ca8c05 |
hex | c6251a4a |
3324320330 has 8 divisors (see below), whose sum is σ = 5983776612. Its totient is φ = 1329728128.
The previous prime is 3324320269. The next prime is 3324320339. The reversal of 3324320330 is 330234233.
It can be written as a sum of positive squares in 2 ways, for example, as 2836308049 + 488012281 = 53257^2 + 22091^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×33243203302 = 22102211312902617800, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3324320296 and 3324320305.
It is not an unprimeable number, because it can be changed into a prime (3324320339) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 166216007 + ... + 166216026.
Almost surely, 23324320330 is an apocalyptic number.
3324320330 is a deficient number, since it is larger than the sum of its proper divisors (2659456282).
3324320330 is a wasteful number, since it uses less digits than its factorization.
3324320330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 332432040.
The product of its (nonzero) digits is 3888, while the sum is 23.
The square root of 3324320330 is about 57656.9191858185. The cubic root of 3324320330 is about 1492.4540030174.
Adding to 3324320330 its reverse (330234233), we get a palindrome (3654554563).
The spelling of 3324320330 in words is "three billion, three hundred twenty-four million, three hundred twenty thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •