Base | Representation |
---|---|
bin | 11010110011011111011001… |
… | …01001111111110010010101 |
3 | 21201200222021020020101111021 |
4 | 31121233230221333302111 |
5 | 30211213403444311112 |
6 | 325210224433041141 |
7 | 15262356322444363 |
oct | 1531575451776225 |
9 | 251628236211437 |
10 | 58943806635157 |
11 | 17865a23202524 |
12 | 673b8556b61b1 |
13 | 26b74b96a4012 |
14 | 107ac77218633 |
15 | 6c33e4db5907 |
hex | 359beca7fc95 |
58943806635157 has 2 divisors, whose sum is σ = 58943806635158. Its totient is φ = 58943806635156.
The previous prime is 58943806635151. The next prime is 58943806635173. The reversal of 58943806635157 is 75153660834985.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 35976315896676 + 22967490738481 = 5998026^2 + 4792441^2 .
It is a cyclic number.
It is not a de Polignac number, because 58943806635157 - 23 = 58943806635149 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (58943806635151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 29471903317578 + 29471903317579.
It is an arithmetic number, because the mean of its divisors is an integer number (29471903317579).
Almost surely, 258943806635157 is an apocalyptic number.
It is an amenable number.
58943806635157 is a deficient number, since it is larger than the sum of its proper divisors (1).
58943806635157 is an equidigital number, since it uses as much as digits as its factorization.
58943806635157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 653184000, while the sum is 70.
The spelling of 58943806635157 in words is "fifty-eight trillion, nine hundred forty-three billion, eight hundred six million, six hundred thirty-five thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •