Base | Representation |
---|---|
bin | 1101010001101110011101 |
3 | 20112211022120 |
4 | 31101232131 |
5 | 1342333402 |
6 | 202333153 |
7 | 41404110 |
oct | 15215635 |
9 | 6484276 |
10 | 3480477 |
11 | 1a67a30 |
12 | 11ba1b9 |
13 | 94b270 |
14 | 668577 |
15 | 48b3bc |
hex | 351b9d |
3480477 has 64 divisors (see below), whose sum is σ = 6666240. Its totient is φ = 1555200.
The previous prime is 3480443. The next prime is 3480487. The reversal of 3480477 is 7740843.
It is a happy number.
It is not a de Polignac number, because 3480477 - 26 = 3480413 is a prime.
It is a super-2 number, since 2×34804772 = 24227440295058, which contains 22 as substring.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Harshad number since it is a multiple of its sum of digits (33).
3480477 is a lucky number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3480437) 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 in 63 ways as a sum of consecutive naturals, for example, 57027 + ... + 57087.
It is an arithmetic number, because the mean of its divisors is an integer number (104160).
Almost surely, 23480477 is an apocalyptic number.
It is an amenable number.
3480477 is a deficient number, since it is larger than the sum of its proper divisors (3185763).
3480477 is a wasteful number, since it uses less digits than its factorization.
3480477 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114.
The product of its (nonzero) digits is 18816, while the sum is 33.
The square root of 3480477 is about 1865.6036556568. The cubic root of 3480477 is about 151.5466205137.
The spelling of 3480477 in words is "three million, four hundred eighty thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •