Base | Representation |
---|---|
bin | 110000110010011111… |
… | …000101100110001101 |
3 | 12000012220122220200112 |
4 | 300302133011212031 |
5 | 1324241433231431 |
6 | 40022135005405 |
7 | 3533121621653 |
oct | 606237054615 |
9 | 160186586615 |
10 | 52386617741 |
11 | 20242975307 |
12 | a1a0209865 |
13 | 4c2b351483 |
14 | 276d6a8dd3 |
15 | 1569175c2b |
hex | c327c598d |
52386617741 has 2 divisors, whose sum is σ = 52386617742. Its totient is φ = 52386617740.
The previous prime is 52386617729. The next prime is 52386617743. The reversal of 52386617741 is 14771668325.
52386617741 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 39892072900 + 12494544841 = 199730^2 + 111779^2 .
It is a cyclic number.
It is not a de Polignac number, because 52386617741 - 218 = 52386355597 is a prime.
Together with 52386617743, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 52386617741.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (52386617743) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26193308870 + 26193308871.
It is an arithmetic number, because the mean of its divisors is an integer number (26193308871).
Almost surely, 252386617741 is an apocalyptic number.
It is an amenable number.
52386617741 is a deficient number, since it is larger than the sum of its proper divisors (1).
52386617741 is an equidigital number, since it uses as much as digits as its factorization.
52386617741 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1693440, while the sum is 50.
The spelling of 52386617741 in words is "fifty-two billion, three hundred eighty-six million, six hundred seventeen thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •