Base | Representation |
---|---|
bin | 1100110110100111011001 |
3 | 20100011222211 |
4 | 30312213121 |
5 | 1330310213 |
6 | 200115121 |
7 | 40432264 |
oct | 14664731 |
9 | 6304884 |
10 | 3369433 |
11 | 19a1561 |
12 | 1165aa1 |
13 | 90c862 |
14 | 639cdb |
15 | 46853d |
hex | 3369d9 |
3369433 has 2 divisors, whose sum is σ = 3369434. Its totient is φ = 3369432.
The previous prime is 3369419. The next prime is 3369463. The reversal of 3369433 is 3349633.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2108304 + 1261129 = 1452^2 + 1123^2 .
It is a cyclic number.
It is not a de Polignac number, because 3369433 - 221 = 1272281 is a prime.
It is a super-2 number, since 2×33694332 = 22706157482978, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3369395 and 3369404.
It is not a weakly prime, because it can be changed into another prime (3369463) 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 as a sum of consecutive naturals, namely, 1684716 + 1684717.
It is an arithmetic number, because the mean of its divisors is an integer number (1684717).
Almost surely, 23369433 is an apocalyptic number.
It is an amenable number.
3369433 is a deficient number, since it is larger than the sum of its proper divisors (1).
3369433 is an equidigital number, since it uses as much as digits as its factorization.
3369433 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 17496, while the sum is 31.
The square root of 3369433 is about 1835.6015362818. The cubic root of 3369433 is about 149.9174805378.
The spelling of 3369433 in words is "three million, three hundred sixty-nine thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •