Base | Representation |
---|---|
bin | 1110100010001010000 |
3 | 220012021112 |
4 | 1310101100 |
5 | 110214430 |
6 | 14112452 |
7 | 4022312 |
oct | 1642120 |
9 | 805245 |
10 | 476240 |
11 | 2a5896 |
12 | 1ab728 |
13 | 1389cb |
14 | c57b2 |
15 | 96195 |
hex | 74450 |
476240 has 20 divisors (see below), whose sum is σ = 1107444. Its totient is φ = 190464.
The previous prime is 476237. The next prime is 476243. The reversal of 476240 is 42674.
It is an interprime number because it is at equal distance from previous prime (476237) and next prime (476243).
It can be written as a sum of positive squares in 2 ways, for example, as 61504 + 414736 = 248^2 + 644^2 .
It is a tau number, because it is divible by the number of its divisors (20).
It is a congruent number.
It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 476240.
It is not an unprimeable number, because it can be changed into a prime (476243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2897 + ... + 3056.
2476240 is an apocalyptic number.
476240 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
476240 is an abundant number, since it is smaller than the sum of its proper divisors (631204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
476240 is a wasteful number, since it uses less digits than its factorization.
476240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5966 (or 5960 counting only the distinct ones).
The product of its (nonzero) digits is 1344, while the sum is 23.
The square root of 476240 is about 690.1014418185. The cubic root of 476240 is about 78.0923735765.
The spelling of 476240 in words is "four hundred seventy-six thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.183 sec. • engine limits •