Base | Representation |
---|---|
bin | 110000111011101001… |
… | …000101001010100101 |
3 | 12000121121201100022202 |
4 | 300323221011022211 |
5 | 1330100244413412 |
6 | 40045303304245 |
7 | 3536665414664 |
oct | 607351051245 |
9 | 160547640282 |
10 | 52540232357 |
11 | 20311656238 |
12 | a22374b085 |
13 | 4c541176b2 |
14 | 2785c54ddb |
15 | 15778bb3c2 |
hex | c3ba452a5 |
52540232357 has 2 divisors, whose sum is σ = 52540232358. Its totient is φ = 52540232356.
The previous prime is 52540232287. The next prime is 52540232369. The reversal of 52540232357 is 75323204525.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 39096757441 + 13443474916 = 197729^2 + 115946^2 .
It is a cyclic number.
It is not a de Polignac number, because 52540232357 - 228 = 52271796901 is a prime.
It is a super-2 number, since 2×525402323572 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 52540232357.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (52540232377) 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, 26270116178 + 26270116179.
It is an arithmetic number, because the mean of its divisors is an integer number (26270116179).
Almost surely, 252540232357 is an apocalyptic number.
It is an amenable number.
52540232357 is a deficient number, since it is larger than the sum of its proper divisors (1).
52540232357 is an equidigital number, since it uses as much as digits as its factorization.
52540232357 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252000, while the sum is 38.
The spelling of 52540232357 in words is "fifty-two billion, five hundred forty million, two hundred thirty-two thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •