Base | Representation |
---|---|
bin | 1101111001001… |
… | …0001001101001 |
3 | 11001122102211202 |
4 | 3132102021221 |
5 | 104404122223 |
6 | 5440533545 |
7 | 1305201203 |
oct | 336221151 |
9 | 131572752 |
10 | 58270313 |
11 | 2a98a392 |
12 | 176212b5 |
13 | c0c289a |
14 | 7a4b773 |
15 | 51b0428 |
hex | 3792269 |
58270313 has 4 divisors (see below), whose sum is σ = 58299648. Its totient is φ = 58240980.
The previous prime is 58270291. The next prime is 58270327. The reversal of 58270313 is 31307285.
58270313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 58270313 - 26 = 58270249 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (58270343) 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, 11453 + ... + 15738.
It is an arithmetic number, because the mean of its divisors is an integer number (14574912).
Almost surely, 258270313 is an apocalyptic number.
It is an amenable number.
58270313 is a deficient number, since it is larger than the sum of its proper divisors (29335).
58270313 is a wasteful number, since it uses less digits than its factorization.
58270313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29334.
The product of its (nonzero) digits is 5040, while the sum is 29.
The square root of 58270313 is about 7633.4993941180. The cubic root of 58270313 is about 387.6880818484.
Adding to 58270313 its reverse (31307285), we get a palindrome (89577598).
The spelling of 58270313 in words is "fifty-eight million, two hundred seventy thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •