Base | Representation |
---|---|
bin | 110110000100110010… |
… | …001100111000101101 |
3 | 12112212110111211120012 |
4 | 312010302030320231 |
5 | 1422402423433331 |
6 | 42401245103005 |
7 | 4123560432164 |
oct | 660462147055 |
9 | 175773454505 |
10 | 58062327341 |
11 | 226957409a7 |
12 | b304b57a65 |
13 | 5624196215 |
14 | 2b4b3c03db |
15 | 179c5a282b |
hex | d84c8ce2d |
58062327341 has 2 divisors, whose sum is σ = 58062327342. Its totient is φ = 58062327340.
The previous prime is 58062327319. The next prime is 58062327343. The reversal of 58062327341 is 14372326085.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 51538534441 + 6523792900 = 227021^2 + 80770^2 .
It is a cyclic number.
It is not a de Polignac number, because 58062327341 - 222 = 58058133037 is a prime.
It is a super-2 number, since 2×580623273412 (a number of 22 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 58062327343, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (58062327343) 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 as a sum of consecutive naturals, namely, 29031163670 + 29031163671.
It is an arithmetic number, because the mean of its divisors is an integer number (29031163671).
Almost surely, 258062327341 is an apocalyptic number.
It is an amenable number.
58062327341 is a deficient number, since it is larger than the sum of its proper divisors (1).
58062327341 is an equidigital number, since it uses as much as digits as its factorization.
58062327341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 241920, while the sum is 41.
The spelling of 58062327341 in words is "fifty-eight billion, sixty-two million, three hundred twenty-seven thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •