Base | Representation |
---|---|
bin | 10110001001000100000100 |
3 | 101220212222210 |
4 | 112021010010 |
5 | 2441214132 |
6 | 324223420 |
7 | 100223064 |
oct | 26110404 |
9 | 11825883 |
10 | 5804292 |
11 | 330493a |
12 | 1b3ab70 |
13 | 1282bc0 |
14 | ab13a4 |
15 | 799bcc |
hex | 589104 |
5804292 has 48 divisors (see below), whose sum is σ = 15099840. Its totient is φ = 1723008.
The previous prime is 5804261. The next prime is 5804297. The reversal of 5804292 is 2924085.
It is a plaindrome in base 15.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5804297) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3883 + ... + 5165.
It is an arithmetic number, because the mean of its divisors is an integer number (314580).
Almost surely, 25804292 is an apocalyptic number.
5804292 is a gapful number since it is divisible by the number (52) 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 5804292, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7549920).
5804292 is an abundant number, since it is smaller than the sum of its proper divisors (9295548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5804292 is a wasteful number, since it uses less digits than its factorization.
5804292 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1332 (or 1330 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 30.
The square root of 5804292 is about 2409.2098289688. The cubic root of 5804292 is about 179.7144856308.
The spelling of 5804292 in words is "five million, eight hundred four thousand, two hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.157 sec. • engine limits •