Base | Representation |
---|---|
bin | 1110000101100… |
… | …1011011011000 |
3 | 11010011220111211 |
4 | 3201121123120 |
5 | 110111232202 |
6 | 5510232504 |
7 | 1315141000 |
oct | 341313330 |
9 | 133156454 |
10 | 59086552 |
11 | 30397668 |
12 | 17955734 |
13 | c31a275 |
14 | 7bc1000 |
15 | 52c21d7 |
hex | 38596d8 |
59086552 has 64 divisors (see below), whose sum is σ = 131688000. Its totient is φ = 24837120.
The previous prime is 59086519. The next prime is 59086583. The reversal of 59086552 is 25568095.
59086552 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
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, 167208 + ... + 167560.
It is an arithmetic number, because the mean of its divisors is an integer number (2057625).
Almost surely, 259086552 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 59086552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (65844000).
59086552 is an abundant number, since it is smaller than the sum of its proper divisors (72601448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
59086552 is a wasteful number, since it uses less digits than its factorization.
59086552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 441 (or 423 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 40.
The square root of 59086552 is about 7686.7777384285. Note that the first 4 decimals coincide. The cubic root of 59086552 is about 389.4899139009.
The spelling of 59086552 in words is "fifty-nine million, eighty-six thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •