Base | Representation |
---|---|
bin | 10111101100101110001010… |
… | …01110010000010001011011 |
3 | 20211112001201111211002102012 |
4 | 23312113011032100101123 |
5 | 23312314233121104322 |
6 | 302500524133500135 |
7 | 13656060101020136 |
oct | 1366270516202133 |
9 | 224461644732365 |
10 | 52114147050587 |
11 | 15672538440516 |
12 | 5a180a24a164b |
13 | 231045c6b121b |
14 | cc24a3d4d21d |
15 | 60591dd55ae2 |
hex | 2f65c539045b |
52114147050587 has 2 divisors, whose sum is σ = 52114147050588. Its totient is φ = 52114147050586.
The previous prime is 52114147050551. The next prime is 52114147050709. The reversal of 52114147050587 is 78505074141125.
52114147050587 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 52114147050587 - 212 = 52114147046491 is a prime.
It is a super-2 number, since 2×521141470505872 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (52114147250587) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26057073525293 + 26057073525294.
It is an arithmetic number, because the mean of its divisors is an integer number (26057073525294).
Almost surely, 252114147050587 is an apocalyptic number.
52114147050587 is a deficient number, since it is larger than the sum of its proper divisors (1).
52114147050587 is an equidigital number, since it uses as much as digits as its factorization.
52114147050587 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1568000, while the sum is 50.
The spelling of 52114147050587 in words is "fifty-two trillion, one hundred fourteen billion, one hundred forty-seven million, fifty thousand, five hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •