Base | Representation |
---|---|
bin | 110000011110100001… |
… | …001001110100110011 |
3 | 11222100120022000100121 |
4 | 300132201021310303 |
5 | 1323100203140102 |
6 | 35525010431111 |
7 | 3521613266446 |
oct | 603641116463 |
9 | 158316260317 |
10 | 52051615027 |
11 | 20090863865 |
12 | a107b92497 |
13 | 4ba6b19609 |
14 | 273adc365d |
15 | 1549a50b37 |
hex | c1e849d33 |
52051615027 has 2 divisors, whose sum is σ = 52051615028. Its totient is φ = 52051615026.
The previous prime is 52051615009. The next prime is 52051615061. The reversal of 52051615027 is 72051615025.
It is an a-pointer prime, because the next prime (52051615061) can be obtained adding 52051615027 to its sum of digits (34).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 52051615027 - 231 = 49904131379 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 52051614983 and 52051615001.
It is not a weakly prime, because it can be changed into another prime (52051615127) 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, 26025807513 + 26025807514.
It is an arithmetic number, because the mean of its divisors is an integer number (26025807514).
Almost surely, 252051615027 is an apocalyptic number.
52051615027 is a deficient number, since it is larger than the sum of its proper divisors (1).
52051615027 is an equidigital number, since it uses as much as digits as its factorization.
52051615027 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 34.
The spelling of 52051615027 in words is "fifty-two billion, fifty-one million, six hundred fifteen thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •