Base | Representation |
---|---|
bin | 10011110100100100010 |
3 | 1012222221210 |
4 | 2132210202 |
5 | 131241011 |
6 | 21530550 |
7 | 5343414 |
oct | 2364442 |
9 | 1188853 |
10 | 649506 |
11 | 403a90 |
12 | 273a56 |
13 | 199830 |
14 | 12c9b4 |
15 | cc6a6 |
hex | 9e922 |
649506 has 32 divisors (see below), whose sum is σ = 1528128. Its totient is φ = 181440.
The previous prime is 649501. The next prime is 649507. The reversal of 649506 is 605946.
It is a Smith number, since the sum of its digits (30) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Curzon number.
It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 649506.
It is not an unprimeable number, because it can be changed into a prime (649501) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 480 + ... + 1236.
It is an arithmetic number, because the mean of its divisors is an integer number (47754).
2649506 is an apocalyptic number.
649506 is a gapful number since it is divisible by the number (66) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 649506, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (764064).
649506 is an abundant number, since it is smaller than the sum of its proper divisors (878622).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
649506 is a wasteful number, since it uses less digits than its factorization.
649506 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 786.
The product of its (nonzero) digits is 6480, while the sum is 30.
The square root of 649506 is about 805.9193508038. The cubic root of 649506 is about 86.6019602484.
The spelling of 649506 in words is "six hundred forty-nine thousand, five hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •