Base | Representation |
---|---|
bin | 10111001111011001000111… |
… | …11001110111001011010001 |
3 | 20200221201121011020200120222 |
4 | 23213230203321313023101 |
5 | 23144311421031211443 |
6 | 300405544151442425 |
7 | 13523213454235343 |
oct | 1347544371671321 |
9 | 220851534220528 |
10 | 51106418225873 |
11 | 1531412382418a |
12 | 5894924086415 |
13 | 226941211a32a |
14 | c897c726b293 |
15 | 5d95ddd0c468 |
hex | 2e7b23e772d1 |
51106418225873 has 2 divisors, whose sum is σ = 51106418225874. Its totient is φ = 51106418225872.
The previous prime is 51106418225867. The next prime is 51106418225899. The reversal of 51106418225873 is 37852281460115.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 26387453944384 + 24718964281489 = 5136872^2 + 4971817^2 .
It is a cyclic number.
It is not a de Polignac number, because 51106418225873 - 26 = 51106418225809 is a prime.
It is a super-2 number, since 2×511064182258732 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (51106418425873) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25553209112936 + 25553209112937.
It is an arithmetic number, because the mean of its divisors is an integer number (25553209112937).
Almost surely, 251106418225873 is an apocalyptic number.
It is an amenable number.
51106418225873 is a deficient number, since it is larger than the sum of its proper divisors (1).
51106418225873 is an equidigital number, since it uses as much as digits as its factorization.
51106418225873 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3225600, while the sum is 53.
Adding to 51106418225873 its reverse (37852281460115), we get a palindrome (88958699685988).
The spelling of 51106418225873 in words is "fifty-one trillion, one hundred six billion, four hundred eighteen million, two hundred twenty-five thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •