Base | Representation |
---|---|
bin | 1100000101001100… |
… | …0101000011011001 |
3 | 22101000021200022202 |
4 | 3001103011003121 |
5 | 23120202112441 |
6 | 1253444455545 |
7 | 143236036340 |
oct | 30123050331 |
9 | 8330250282 |
10 | 3243004121 |
11 | 1414655aa5 |
12 | 7660aa5b5 |
13 | 3c8b47866 |
14 | 22a9c0b57 |
15 | 13ea9519b |
hex | c14c50d9 |
3243004121 has 8 divisors (see below), whose sum is σ = 3776220864. Its totient is φ = 2727270000.
The previous prime is 3243004111. The next prime is 3243004129. The reversal of 3243004121 is 1214003423.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3243004121 - 218 = 3242741977 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3243004093 and 3243004102.
It is not an unprimeable number, because it can be changed into a prime (3243004129) 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 7 ways as a sum of consecutive naturals, for example, 4370255 + ... + 4370996.
It is an arithmetic number, because the mean of its divisors is an integer number (472027608).
Almost surely, 23243004121 is an apocalyptic number.
It is an amenable number.
3243004121 is a deficient number, since it is larger than the sum of its proper divisors (533216743).
3243004121 is an equidigital number, since it uses as much as digits as its factorization.
3243004121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8741311.
The product of its (nonzero) digits is 576, while the sum is 20.
The square root of 3243004121 is about 56947.3802821517. The cubic root of 3243004121 is about 1480.1844366263.
Adding to 3243004121 its reverse (1214003423), we get a palindrome (4457007544).
The spelling of 3243004121 in words is "three billion, two hundred forty-three million, four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •