Base | Representation |
---|---|
bin | 10111010011101110011010… |
… | …00011101110101001101001 |
3 | 20201110221211221102220100022 |
4 | 23221313031003232221221 |
5 | 23204231310433044321 |
6 | 301002204120250225 |
7 | 13540033513326626 |
oct | 1351671503565151 |
9 | 221427757386308 |
10 | 51255285049961 |
11 | 15371276208513 |
12 | 58b974b310975 |
13 | 227a4779a13a5 |
14 | c92aaa32534d |
15 | 5dd4031a0dab |
hex | 2e9dcd0eea69 |
51255285049961 has 2 divisors, whose sum is σ = 51255285049962. Its totient is φ = 51255285049960.
The previous prime is 51255285049939. The next prime is 51255285050029. The reversal of 51255285049961 is 16994058255215.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 51214347216400 + 40937833561 = 7156420^2 + 202331^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51255285049961 is a prime.
It is a super-2 number, since 2×512552850499612 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 51255285049894 and 51255285049903.
It is not a weakly prime, because it can be changed into another prime (51255285043961) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25627642524980 + 25627642524981.
It is an arithmetic number, because the mean of its divisors is an integer number (25627642524981).
Almost surely, 251255285049961 is an apocalyptic number.
It is an amenable number.
51255285049961 is a deficient number, since it is larger than the sum of its proper divisors (1).
51255285049961 is an equidigital number, since it uses as much as digits as its factorization.
51255285049961 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 38880000, while the sum is 62.
The spelling of 51255285049961 in words is "fifty-one trillion, two hundred fifty-five billion, two hundred eighty-five million, forty-nine thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •