Base | Representation |
---|---|
bin | 1101111101000… |
… | …1111001000000 |
3 | 11002010200222100 |
4 | 3133101321000 |
5 | 104441001032 |
6 | 5450310400 |
7 | 1310336313 |
oct | 337217100 |
9 | 132120870 |
10 | 58531392 |
11 | 30048557 |
12 | 17728400 |
13 | c18467a |
14 | 7ab897a |
15 | 521297c |
hex | 37d1e40 |
58531392 has 84 divisors (see below), whose sum is σ = 168824656. Its totient is φ = 19388160.
The previous prime is 58531387. The next prime is 58531399. The reversal of 58531392 is 29313585.
58531392 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (58531399) 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 11 ways as a sum of consecutive naturals, for example, 176667 + ... + 176997.
Almost surely, 258531392 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 58531392, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (84412328).
58531392 is an abundant number, since it is smaller than the sum of its proper divisors (110293264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
58531392 is a wasteful number, since it uses less digits than its factorization.
58531392 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 656 (or 643 counting only the distinct ones).
The product of its digits is 32400, while the sum is 36.
The square root of 58531392 is about 7650.5811543961. The cubic root of 58531392 is about 388.2662288752.
The spelling of 58531392 in words is "fifty-eight million, five hundred thirty-one thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.131 sec. • engine limits •