Base | Representation |
---|---|
bin | 1111011101001101110 |
3 | 221201202110 |
4 | 1323221232 |
5 | 112201403 |
6 | 14504450 |
7 | 4206420 |
oct | 1735156 |
9 | 851673 |
10 | 506478 |
11 | 316585 |
12 | 205126 |
13 | 1496bb |
14 | d2810 |
15 | a0103 |
hex | 7ba6e |
506478 has 32 divisors (see below), whose sum is σ = 1198080. Its totient is φ = 139680.
The previous prime is 506461. The next prime is 506479. The reversal of 506478 is 874605.
It is a happy number.
It is an Ulam number.
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 506478.
It is not an unprimeable number, because it can be changed into a prime (506479) by changing a digit.
506478 is an untouchable number, because it is not equal to the sum of proper divisors of any 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 15 ways as a sum of consecutive naturals, for example, 1108 + ... + 1496.
It is an arithmetic number, because the mean of its divisors is an integer number (37440).
2506478 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 506478, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (599040).
506478 is an abundant number, since it is smaller than the sum of its proper divisors (691602).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
506478 is a wasteful number, since it uses less digits than its factorization.
506478 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 432.
The product of its (nonzero) digits is 6720, while the sum is 30.
The square root of 506478 is about 711.6726775702. The cubic root of 506478 is about 79.7113556413.
The spelling of 506478 in words is "five hundred six thousand, four hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •