Base | Representation |
---|---|
bin | 10111001110111100101100… |
… | …11001010100010000000111 |
3 | 20200220021012201201002212222 |
4 | 23213132112121110100013 |
5 | 23144034143224023441 |
6 | 300354542102002555 |
7 | 13522133360552552 |
oct | 1347362631242007 |
9 | 220807181632788 |
10 | 51091159204871 |
11 | 15308703477925 |
12 | 5891985a1645b |
13 | 2267b4ca20816 |
14 | c88b7a89d699 |
15 | 5d8ee93d0d4b |
hex | 2e7796654407 |
51091159204871 has 2 divisors, whose sum is σ = 51091159204872. Its totient is φ = 51091159204870.
The previous prime is 51091159204849. The next prime is 51091159204879. The reversal of 51091159204871 is 17840295119015.
51091159204871 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51091159204871 is a prime.
It is a super-2 number, since 2×510911592048712 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51091159204879) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25545579602435 + 25545579602436.
It is an arithmetic number, because the mean of its divisors is an integer number (25545579602436).
Almost surely, 251091159204871 is an apocalyptic number.
51091159204871 is a deficient number, since it is larger than the sum of its proper divisors (1).
51091159204871 is an equidigital number, since it uses as much as digits as its factorization.
51091159204871 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 907200, while the sum is 53.
The spelling of 51091159204871 in words is "fifty-one trillion, ninety-one billion, one hundred fifty-nine million, two hundred four thousand, eight hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •