Base | Representation |
---|---|
bin | 1111001010100110000 |
3 | 221020200100 |
4 | 1321110300 |
5 | 111400234 |
6 | 14352400 |
7 | 4136550 |
oct | 1712460 |
9 | 836610 |
10 | 496944 |
11 | 30a3a8 |
12 | 1bb700 |
13 | 145266 |
14 | cd160 |
15 | 9c399 |
hex | 79530 |
496944 has 120 divisors (see below), whose sum is σ = 1740960. Its totient is φ = 129024.
The previous prime is 496919. The next prime is 496949. The reversal of 496944 is 449694.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a nude number because it is divisible by every one of its digits.
It is a junction number, because it is equal to n+sod(n) for n = 496899 and 496908.
It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 496944.
It is not an unprimeable number, because it can be changed into a prime (496949) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 17122 + ... + 17150.
It is an arithmetic number, because the mean of its divisors is an integer number (14508).
2496944 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 496944, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (870480).
496944 is an abundant number, since it is smaller than the sum of its proper divisors (1244016).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
496944 is a wasteful number, since it uses less digits than its factorization.
496944 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67 (or 58 counting only the distinct ones).
The product of its digits is 31104, while the sum is 36.
The square root of 496944 is about 704.9425508508. The cubic root of 496944 is about 79.2080187779.
The spelling of 496944 in words is "four hundred ninety-six thousand, nine hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •