Base | Representation |
---|---|
bin | 110110000100010111… |
… | …110101001100000101 |
3 | 12112211222111121222021 |
4 | 312010113311030011 |
5 | 1422344141231113 |
6 | 42400441003141 |
7 | 4123444611214 |
oct | 660427651405 |
9 | 175758447867 |
10 | 58055414533 |
11 | 2269184a236 |
12 | b3027834b1 |
13 | 56229158bc |
14 | 2b4a50107b |
15 | 179bb8948d |
hex | d845f5305 |
58055414533 has 2 divisors, whose sum is σ = 58055414534. Its totient is φ = 58055414532.
The previous prime is 58055414437. The next prime is 58055414537. The reversal of 58055414533 is 33541455085.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 37209252609 + 20846161924 = 192897^2 + 144382^2 .
It is a cyclic number.
It is not a de Polignac number, because 58055414533 - 221 = 58053317381 is a prime.
It is a super-3 number, since 3×580554145333 (a number of 33 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 58055414533.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (58055414537) 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, 29027707266 + 29027707267.
It is an arithmetic number, because the mean of its divisors is an integer number (29027707267).
Almost surely, 258055414533 is an apocalyptic number.
It is an amenable number.
58055414533 is a deficient number, since it is larger than the sum of its proper divisors (1).
58055414533 is an equidigital number, since it uses as much as digits as its factorization.
58055414533 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 720000, while the sum is 43.
The spelling of 58055414533 in words is "fifty-eight billion, fifty-five million, four hundred fourteen thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •