Base | Representation |
---|---|
bin | 1101010010111110100101 |
3 | 20120002100111 |
4 | 31102332211 |
5 | 1343014410 |
6 | 202413021 |
7 | 41425054 |
oct | 15227645 |
9 | 6502314 |
10 | 3485605 |
11 | 1a70872 |
12 | 1201171 |
13 | 9506b6 |
14 | 66a39b |
15 | 48cb8a |
hex | 352fa5 |
3485605 has 4 divisors (see below), whose sum is σ = 4182732. Its totient is φ = 2788480.
The previous prime is 3485593. The next prime is 3485617. The reversal of 3485605 is 5065843.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (3485593) and next prime (3485617).
It can be written as a sum of positive squares in 2 ways, for example, as 1852321 + 1633284 = 1361^2 + 1278^2 .
It is not a de Polignac number, because 3485605 - 27 = 3485477 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 in 3 ways as a sum of consecutive naturals, for example, 348556 + ... + 348565.
It is an arithmetic number, because the mean of its divisors is an integer number (1045683).
Almost surely, 23485605 is an apocalyptic number.
It is an amenable number.
3485605 is a deficient number, since it is larger than the sum of its proper divisors (697127).
3485605 is an equidigital number, since it uses as much as digits as its factorization.
3485605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 697126.
The product of its (nonzero) digits is 14400, while the sum is 31.
The square root of 3485605 is about 1866.9775038816. The cubic root of 3485605 is about 151.6210116309.
The spelling of 3485605 in words is "three million, four hundred eighty-five thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •