Base | Representation |
---|---|
bin | 1100010111111010000001 |
3 | 20002210110011 |
4 | 30113322001 |
5 | 1312244044 |
6 | 153304521 |
7 | 36366463 |
oct | 14277201 |
9 | 6083404 |
10 | 3243649 |
11 | 1916002 |
12 | 1105141 |
13 | 897526 |
14 | 606133 |
15 | 441134 |
hex | 317e81 |
3243649 has 2 divisors, whose sum is σ = 3243650. Its totient is φ = 3243648.
The previous prime is 3243637. The next prime is 3243677. The reversal of 3243649 is 9463423.
3243649 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1803649 + 1440000 = 1343^2 + 1200^2 .
It is a cyclic number.
It is not a de Polignac number, because 3243649 - 27 = 3243521 is a prime.
3243649 is a lucky number.
It is a self number, because there is not a number n which added to its sum of digits gives 3243649.
It is not a weakly prime, because it can be changed into another prime (3243629) 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 as a sum of consecutive naturals, namely, 1621824 + 1621825.
It is an arithmetic number, because the mean of its divisors is an integer number (1621825).
Almost surely, 23243649 is an apocalyptic number.
It is an amenable number.
3243649 is a deficient number, since it is larger than the sum of its proper divisors (1).
3243649 is an equidigital number, since it uses as much as digits as its factorization.
3243649 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 15552, while the sum is 31.
The square root of 3243649 is about 1801.0133258807. The cubic root of 3243649 is about 148.0282542843.
It can be divided in two parts, 32 and 43649, that added together give a square (43681 = 2092).
The spelling of 3243649 in words is "three million, two hundred forty-three thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •