Base | Representation |
---|---|
bin | 1101110101110… |
… | …0100100100100 |
3 | 11001020021210120 |
4 | 3131130210210 |
5 | 104330111402 |
6 | 5432121540 |
7 | 1303265316 |
oct | 335344444 |
9 | 131207716 |
10 | 58050852 |
11 | 2a84a512 |
12 | 175362b0 |
13 | c046a22 |
14 | 79d17b6 |
15 | 516a3bc |
hex | 375c924 |
58050852 has 72 divisors (see below), whose sum is σ = 151633440. Its totient is φ = 17233920.
The previous prime is 58050851. The next prime is 58050857. The reversal of 58050852 is 25805085.
58050852 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (58050851) 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 23 ways as a sum of consecutive naturals, for example, 65452 + ... + 66332.
It is an arithmetic number, because the mean of its divisors is an integer number (2106020).
Almost surely, 258050852 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 58050852, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (75816720).
58050852 is an abundant number, since it is smaller than the sum of its proper divisors (93582588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
58050852 is a wasteful number, since it uses less digits than its factorization.
58050852 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 941 (or 922 counting only the distinct ones).
The product of its (nonzero) digits is 16000, while the sum is 33.
The square root of 58050852 is about 7619.1109717604. The cubic root of 58050852 is about 387.2007584992.
The spelling of 58050852 in words is "fifty-eight million, fifty thousand, eight hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •