Base | Representation |
---|---|
bin | 1101111000111… |
… | …0011101111111 |
3 | 11001121200011011 |
4 | 3132032131333 |
5 | 104403131411 |
6 | 5440340051 |
7 | 1305106216 |
oct | 336163577 |
9 | 131550134 |
10 | 58255231 |
11 | 2a97a021 |
12 | 17614627 |
13 | c0b8a68 |
14 | 7a4607d |
15 | 51aac21 |
hex | 378e77f |
58255231 has 8 divisors (see below), whose sum is σ = 61415424. Its totient is φ = 55175160.
The previous prime is 58255181. The next prime is 58255291. The reversal of 58255231 is 13255285.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 58255231 - 213 = 58247039 is a prime.
It is a super-2 number, since 2×582552312 = 6787343877726722, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 58255193 and 58255202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (58255291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18535 + ... + 21448.
It is an arithmetic number, because the mean of its divisors is an integer number (7676928).
Almost surely, 258255231 is an apocalyptic number.
58255231 is a deficient number, since it is larger than the sum of its proper divisors (3160193).
58255231 is a wasteful number, since it uses less digits than its factorization.
58255231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40061.
The product of its digits is 12000, while the sum is 31.
The square root of 58255231 is about 7632.5114477477. The cubic root of 58255231 is about 387.6546307600.
The spelling of 58255231 in words is "fifty-eight million, two hundred fifty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •