Base | Representation |
---|---|
bin | 1101111001001… |
… | …0001001111000 |
3 | 11001122102212022 |
4 | 3132102021320 |
5 | 104404122303 |
6 | 5440534012 |
7 | 1305201224 |
oct | 336221170 |
9 | 131572768 |
10 | 58270328 |
11 | 2a98a3a6 |
12 | 17621308 |
13 | c0c28ac |
14 | 7a4b784 |
15 | 51b0438 |
hex | 3792278 |
58270328 has 16 divisors (see below), whose sum is σ = 112781760. Its totient is φ = 28195200.
The previous prime is 58270327. The next prime is 58270337. The reversal of 58270328 is 82307285.
It is a happy number.
58270328 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×582703282 = 6790862250455168, which contains 22 as substring.
It is a Smith number, since the sum of its digits (35) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (58270327) 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 3 ways as a sum of consecutive naturals, for example, 117233 + ... + 117728.
It is an arithmetic number, because the mean of its divisors is an integer number (7048860).
Almost surely, 258270328 is an apocalyptic number.
It is an amenable number.
58270328 is a deficient number, since it is larger than the sum of its proper divisors (54511432).
58270328 is a wasteful number, since it uses less digits than its factorization.
58270328 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 234998 (or 234994 counting only the distinct ones).
The product of its (nonzero) digits is 26880, while the sum is 35.
The square root of 58270328 is about 7633.5003766293. The cubic root of 58270328 is about 387.6881151148.
The spelling of 58270328 in words is "fifty-eight million, two hundred seventy thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •