Base | Representation |
---|---|
bin | 1101001010011100011001 |
3 | 20111022101211 |
4 | 31022130121 |
5 | 1340410044 |
6 | 201543121 |
7 | 41221126 |
oct | 15123431 |
9 | 6438354 |
10 | 3450649 |
11 | 1a47584 |
12 | 11a4aa1 |
13 | 93a807 |
14 | 65b74d |
15 | 482634 |
hex | 34a719 |
3450649 has 2 divisors, whose sum is σ = 3450650. Its totient is φ = 3450648.
The previous prime is 3450631. The next prime is 3450659. The reversal of 3450649 is 9460543.
3450649 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1742400 + 1708249 = 1320^2 + 1307^2 .
It is an emirp because it is prime and its reverse (9460543) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3450649 - 27 = 3450521 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3450649.
It is not a weakly prime, because it can be changed into another prime (3450659) 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, 1725324 + 1725325.
It is an arithmetic number, because the mean of its divisors is an integer number (1725325).
Almost surely, 23450649 is an apocalyptic number.
It is an amenable number.
3450649 is a deficient number, since it is larger than the sum of its proper divisors (1).
3450649 is an equidigital number, since it uses as much as digits as its factorization.
3450649 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 31.
The square root of 3450649 is about 1857.5922588125. The cubic root of 3450649 is about 151.1124551535.
The spelling of 3450649 in words is "three million, four hundred fifty thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •