Base | Representation |
---|---|
bin | 10111010101111111111110… |
… | …11101011000010010100001 |
3 | 20201202102120200212002001011 |
4 | 23222333333131120102201 |
5 | 23212021341122434431 |
6 | 301102131245140521 |
7 | 13545501332665633 |
oct | 1352777735302241 |
9 | 221672520762034 |
10 | 51333440046241 |
11 | 153a1431711a31 |
12 | 591092125a741 |
13 | 22849517b9c12 |
14 | c967a2030a53 |
15 | 5e04796c6cb1 |
hex | 2eafff7584a1 |
51333440046241 has 2 divisors, whose sum is σ = 51333440046242. Its totient is φ = 51333440046240.
The previous prime is 51333440046191. The next prime is 51333440046289. The reversal of 51333440046241 is 14264004433315.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 42860537865616 + 8472902180625 = 6546796^2 + 2910825^2 .
It is a cyclic number.
It is not a de Polignac number, because 51333440046241 - 227 = 51333305828513 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 51333440046194 and 51333440046203.
It is not a weakly prime, because it can be changed into another prime (51333440046541) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25666720023120 + 25666720023121.
It is an arithmetic number, because the mean of its divisors is an integer number (25666720023121).
Almost surely, 251333440046241 is an apocalyptic number.
It is an amenable number.
51333440046241 is a deficient number, since it is larger than the sum of its proper divisors (1).
51333440046241 is an equidigital number, since it uses as much as digits as its factorization.
51333440046241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 414720, while the sum is 40.
Adding to 51333440046241 its reverse (14264004433315), we get a palindrome (65597444479556).
The spelling of 51333440046241 in words is "fifty-one trillion, three hundred thirty-three billion, four hundred forty million, forty-six thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •