Base | Representation |
---|---|
bin | 11000000000010000000000 |
3 | 102211200122211 |
4 | 120000100000 |
5 | 3102324410 |
6 | 342511504 |
7 | 104325265 |
oct | 30002000 |
9 | 12750584 |
10 | 6292480 |
11 | 36086a7 |
12 | 2135594 |
13 | 13c417c |
14 | b9b26c |
15 | 84468a |
hex | 600400 |
6292480 has 44 divisors (see below), whose sum is σ = 15106860. Its totient is φ = 2514944.
The previous prime is 6292471. The next prime is 6292483. The reversal of 6292480 is 842926.
6292480 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 4734976 + 1557504 = 2176^2 + 1248^2 .
It is an Ulam number.
It is not an unprimeable number, because it can be changed into a prime (6292483) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (3) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4506 + ... + 5734.
Almost surely, 26292480 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 6292480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7553430).
6292480 is an abundant number, since it is smaller than the sum of its proper divisors (8814380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6292480 is a wasteful number, since it uses less digits than its factorization.
6292480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1254 (or 1236 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 31.
The square root of 6292480 is about 2508.4816124500. The cubic root of 6292480 is about 184.6179600780.
The spelling of 6292480 in words is "six million, two hundred ninety-two thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •