Base | Representation |
---|---|
bin | 10111011001110111111010… |
… | …11011010100011110011001 |
3 | 20202020011011100121012020221 |
4 | 23230323331123110132121 |
5 | 23221211443241004243 |
6 | 301243223500120041 |
7 | 13561223041260214 |
oct | 1354737533243631 |
9 | 222204140535227 |
10 | 51466549938073 |
11 | 154429287898a6 |
12 | 593268b536021 |
13 | 2294375a7101a |
14 | c9cdcc54a77b |
15 | 5e3b6a589bed |
hex | 2ecefd6d4799 |
51466549938073 has 2 divisors, whose sum is σ = 51466549938074. Its totient is φ = 51466549938072.
The previous prime is 51466549938029. The next prime is 51466549938079. The reversal of 51466549938073 is 37083994566415.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 50306506773264 + 1160043164809 = 7092708^2 + 1077053^2 .
It is a cyclic number.
It is not a de Polignac number, because 51466549938073 - 221 = 51466547840921 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 51466549937993 and 51466549938011.
It is not a weakly prime, because it can be changed into another prime (51466549938079) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25733274969036 + 25733274969037.
It is an arithmetic number, because the mean of its divisors is an integer number (25733274969037).
Almost surely, 251466549938073 is an apocalyptic number.
It is an amenable number.
51466549938073 is a deficient number, since it is larger than the sum of its proper divisors (1).
51466549938073 is an equidigital number, since it uses as much as digits as its factorization.
51466549938073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 587865600, while the sum is 70.
The spelling of 51466549938073 in words is "fifty-one trillion, four hundred sixty-six billion, five hundred forty-nine million, nine hundred thirty-eight thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •