Base | Representation |
---|---|
bin | 1101010001110001100101 |
3 | 20112211120222 |
4 | 31101301211 |
5 | 1342340202 |
6 | 202334125 |
7 | 41404514 |
oct | 15216145 |
9 | 6484528 |
10 | 3480677 |
11 | 1a680a2 |
12 | 11ba345 |
13 | 94b395 |
14 | 66867b |
15 | 48b4a2 |
hex | 351c65 |
3480677 has 2 divisors, whose sum is σ = 3480678. Its totient is φ = 3480676.
The previous prime is 3480671. The next prime is 3480683. The reversal of 3480677 is 7760843.
3480677 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a balanced prime because it is at equal distance from previous prime (3480671) and next prime (3480683).
It can be written as a sum of positive squares in only one way, i.e., 2114116 + 1366561 = 1454^2 + 1169^2 .
It is a cyclic number.
It is not a de Polignac number, because 3480677 - 210 = 3479653 is a prime.
It is a super-2 number, since 2×34806772 = 24230224756658, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3480671) 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, 1740338 + 1740339.
It is an arithmetic number, because the mean of its divisors is an integer number (1740339).
Almost surely, 23480677 is an apocalyptic number.
It is an amenable number.
3480677 is a deficient number, since it is larger than the sum of its proper divisors (1).
3480677 is an equidigital number, since it uses as much as digits as its factorization.
3480677 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28224, while the sum is 35.
The square root of 3480677 is about 1865.6572568401. The cubic root of 3480677 is about 151.5495232522.
The spelling of 3480677 in words is "three million, four hundred eighty thousand, six hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •