Base | Representation |
---|---|
bin | 10111001100100101101110… |
… | …01110010111111110111001 |
3 | 20200121111222222001200001022 |
4 | 23212102313032113332321 |
5 | 23141222144013343243 |
6 | 300253415150032225 |
7 | 13513233653413415 |
oct | 1346226716277671 |
9 | 220544888050038 |
10 | 51010105606073 |
11 | 1528729a869439 |
12 | 587a1251a8675 |
13 | 2260303533383 |
14 | c84c8bc23d45 |
15 | 5d6d53694b68 |
hex | 2e64b7397fb9 |
51010105606073 has 2 divisors, whose sum is σ = 51010105606074. Its totient is φ = 51010105606072.
The previous prime is 51010105606049. The next prime is 51010105606081. The reversal of 51010105606073 is 37060650101015.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 49817735516224 + 1192370089849 = 7058168^2 + 1091957^2 .
It is a cyclic number.
It is not a de Polignac number, because 51010105606073 - 242 = 46612059094969 is a prime.
It is not a weakly prime, because it can be changed into another prime (51010105606573) 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, 25505052803036 + 25505052803037.
It is an arithmetic number, because the mean of its divisors is an integer number (25505052803037).
Almost surely, 251010105606073 is an apocalyptic number.
It is an amenable number.
51010105606073 is a deficient number, since it is larger than the sum of its proper divisors (1).
51010105606073 is an equidigital number, since it uses as much as digits as its factorization.
51010105606073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18900, while the sum is 35.
Adding to 51010105606073 its reverse (37060650101015), we get a palindrome (88070755707088).
The spelling of 51010105606073 in words is "fifty-one trillion, ten billion, one hundred five million, six hundred six thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •