Base | Representation |
---|---|
bin | 10111110111010010100100 |
3 | 102202211022120 |
4 | 113313102210 |
5 | 3100141110 |
6 | 342025540 |
7 | 104113266 |
oct | 27672244 |
9 | 12684276 |
10 | 6255780 |
11 | 3593073 |
12 | 21182b0 |
13 | 13b055b |
14 | b8bb36 |
15 | 838870 |
hex | 5f74a4 |
6255780 has 48 divisors (see below), whose sum is σ = 17950464. Its totient is φ = 1626880.
The previous prime is 6255761. The next prime is 6255787. The reversal of 6255780 is 875526.
It is a happy number.
It is an Ulam number.
It is not an unprimeable number, because it can be changed into a prime (6255787) by changing a digit.
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, 1189 + ... + 3731.
It is an arithmetic number, because the mean of its divisors is an integer number (373968).
Almost surely, 26255780 is an apocalyptic number.
6255780 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 6255780, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8975232).
6255780 is an abundant number, since it is smaller than the sum of its proper divisors (11694684).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6255780 is a wasteful number, since it uses less digits than its factorization.
6255780 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2596 (or 2594 counting only the distinct ones).
The product of its (nonzero) digits is 16800, while the sum is 33.
The square root of 6255780 is about 2501.1557328563. The cubic root of 6255780 is about 184.2583406421.
The spelling of 6255780 in words is "six million, two hundred fifty-five thousand, seven hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •