Base | Representation |
---|---|
bin | 1101111010110… |
… | …1011111001001 |
3 | 11001212010102201 |
4 | 3132231133021 |
5 | 104421213111 |
6 | 5443200201 |
7 | 1306145506 |
oct | 336553711 |
9 | 131763381 |
10 | 58382281 |
11 | 2aa56521 |
12 | 17676061 |
13 | c131839 |
14 | 7a7a4ad |
15 | 51d36c1 |
hex | 37ad7c9 |
58382281 has 4 divisors (see below), whose sum is σ = 58842112. Its totient is φ = 57922452.
The previous prime is 58382273. The next prime is 58382293. The reversal of 58382281 is 18228385.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 58382281 - 23 = 58382273 is a prime.
It is a super-2 number, since 2×583822812 = 6816981469525922, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 58382281.
It is not an unprimeable number, because it can be changed into a prime (58382221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 229725 + ... + 229978.
It is an arithmetic number, because the mean of its divisors is an integer number (14710528).
Almost surely, 258382281 is an apocalyptic number.
It is an amenable number.
58382281 is a deficient number, since it is larger than the sum of its proper divisors (459831).
58382281 is a wasteful number, since it uses less digits than its factorization.
58382281 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 459830.
The product of its digits is 30720, while the sum is 37.
The square root of 58382281 is about 7640.8298633067. The cubic root of 58382281 is about 387.9362407188.
The spelling of 58382281 in words is "fifty-eight million, three hundred eighty-two thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •