Base | Representation |
---|---|
bin | 1101110101010… |
… | …0111111100110 |
3 | 11001011201020000 |
4 | 3131110333212 |
5 | 104323113224 |
6 | 5431322130 |
7 | 1303105656 |
oct | 335247746 |
9 | 131151200 |
10 | 58019814 |
11 | 2a829166 |
12 | 17520346 |
13 | c035868 |
14 | 79c4366 |
15 | 51610c9 |
hex | 3754fe6 |
58019814 has 40 divisors (see below), whose sum is σ = 133046760. Its totient is φ = 18887904.
The previous prime is 58019813. The next prime is 58019831. The reversal of 58019814 is 41891085.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (58019813) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 2802 + ... + 11130.
It is an arithmetic number, because the mean of its divisors is an integer number (3326169).
Almost surely, 258019814 is an apocalyptic number.
58019814 is a gapful number since it is divisible by the number (54) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 58019814, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (66523380).
58019814 is an abundant number, since it is smaller than the sum of its proper divisors (75026946).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
58019814 is a wasteful number, since it uses less digits than its factorization.
58019814 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8386 (or 8377 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 36.
The square root of 58019814 is about 7617.0738476137. The cubic root of 58019814 is about 387.1317380959.
The spelling of 58019814 in words is "fifty-eight million, nineteen thousand, eight hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •