Base | Representation |
---|---|
bin | 1011100110100101001001 |
3 | 12201112022012 |
4 | 23212211021 |
5 | 1234312414 |
6 | 145105305 |
7 | 34565444 |
oct | 13464511 |
9 | 5645265 |
10 | 3041609 |
11 | 179822a |
12 | 1028235 |
13 | 82658c |
14 | 59265b |
15 | 40133e |
hex | 2e6949 |
3041609 has 4 divisors (see below), whose sum is σ = 3045120. Its totient is φ = 3038100.
The previous prime is 3041603. The next prime is 3041611. The reversal of 3041609 is 9061403.
3041609 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 3041609 - 212 = 3037513 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (3041603) 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 3 ways as a sum of consecutive naturals, for example, 584 + ... + 2534.
It is an arithmetic number, because the mean of its divisors is an integer number (761280).
Almost surely, 23041609 is an apocalyptic number.
It is an amenable number.
3041609 is a deficient number, since it is larger than the sum of its proper divisors (3511).
3041609 is a wasteful number, since it uses less digits than its factorization.
3041609 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3510.
The product of its (nonzero) digits is 648, while the sum is 23.
The square root of 3041609 is about 1744.0209287735. The cubic root of 3041609 is about 144.8886819022. Note that the first 3 decimals are identical.
The spelling of 3041609 in words is "three million, forty-one thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •