Base | Representation |
---|---|
bin | 11000101111011010001000 |
3 | 110012111121220 |
4 | 120233122020 |
5 | 3130020030 |
6 | 351002040 |
7 | 106061400 |
oct | 30573210 |
9 | 13174556 |
10 | 6485640 |
11 | 372a837 |
12 | 2209320 |
13 | 1461075 |
14 | c0b800 |
15 | 881a10 |
hex | 62f688 |
6485640 has 96 divisors (see below), whose sum is σ = 22654080. Its totient is φ = 1481088.
The previous prime is 6485629. The next prime is 6485657. The reversal of 6485640 is 465846.
It is a happy number.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5329 + ... + 6431.
It is an arithmetic number, because the mean of its divisors is an integer number (235980).
Almost surely, 26485640 is an apocalyptic number.
6485640 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6485640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11327040).
6485640 is an abundant number, since it is smaller than the sum of its proper divisors (16168440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6485640 is a wasteful number, since it uses less digits than its factorization.
6485640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1131 (or 1120 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 33.
The square root of 6485640 is about 2546.6919719511. The cubic root of 6485640 is about 186.4880235345.
The spelling of 6485640 in words is "six million, four hundred eighty-five thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •