Base | Representation |
---|---|
bin | 1100011101000011100101 |
3 | 20010212101100 |
4 | 30131003211 |
5 | 1313432431 |
6 | 153550313 |
7 | 36515124 |
oct | 14350345 |
9 | 6125340 |
10 | 3264741 |
11 | 192a937 |
12 | 1115399 |
13 | 8a3ccc |
14 | 60dabb |
15 | 4474e6 |
hex | 31d0e5 |
3264741 has 6 divisors (see below), whose sum is σ = 4715750. Its totient is φ = 2176488.
The previous prime is 3264721. The next prime is 3264743. The reversal of 3264741 is 1474623.
3264741 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 3048516 + 216225 = 1746^2 + 465^2 .
It is not a de Polignac number, because 3264741 - 213 = 3256549 is a prime.
It is a d-powerful number, because it can be written as 3 + 221 + 64 + 43 + 76 + 410 + 1 .
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3264743) 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 5 ways as a sum of consecutive naturals, for example, 181366 + ... + 181383.
Almost surely, 23264741 is an apocalyptic number.
It is an amenable number.
3264741 is a deficient number, since it is larger than the sum of its proper divisors (1451009).
3264741 is a wasteful number, since it uses less digits than its factorization.
3264741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 362755 (or 362752 counting only the distinct ones).
The product of its digits is 4032, while the sum is 27.
The square root of 3264741 is about 1806.8594300609. The cubic root of 3264741 is about 148.3484151928.
It can be divided in two parts, 3264 and 741, that added together give a triangular number (4005 = T89).
The spelling of 3264741 in words is "three million, two hundred sixty-four thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •