Base | Representation |
---|---|
bin | 110000100001100111… |
… | …010001010001011111 |
3 | 11222111012000120210212 |
4 | 300201213101101133 |
5 | 1323202002100142 |
6 | 35534103523035 |
7 | 3523113603503 |
oct | 604147212137 |
9 | 158435016725 |
10 | 52103550047 |
11 | 2010810636a |
12 | a12145947b |
13 | 4bb48016b3 |
14 | 2743c62303 |
15 | 154e3add82 |
hex | c219d145f |
52103550047 has 2 divisors, whose sum is σ = 52103550048. Its totient is φ = 52103550046.
The previous prime is 52103550029. The next prime is 52103550061. The reversal of 52103550047 is 74005530125.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 52103550047 - 218 = 52103287903 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 52103549995 and 52103550022.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (52103550077) 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, 26051775023 + 26051775024.
It is an arithmetic number, because the mean of its divisors is an integer number (26051775024).
Almost surely, 252103550047 is an apocalyptic number.
52103550047 is a deficient number, since it is larger than the sum of its proper divisors (1).
52103550047 is an equidigital number, since it uses as much as digits as its factorization.
52103550047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21000, while the sum is 32.
The spelling of 52103550047 in words is "fifty-two billion, one hundred three million, five hundred fifty thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •