Base | Representation |
---|---|
bin | 10111001111100000000110… |
… | …11101011000000001111011 |
3 | 20200222002021112201101000221 |
4 | 23213300003131120001323 |
5 | 23144342111211322101 |
6 | 300411404252440511 |
7 | 13523405426116204 |
oct | 1347600335300173 |
9 | 220862245641027 |
10 | 51110168854651 |
11 | 15315778974095 |
12 | 58955b0179137 |
13 | 226988c1895ba |
14 | c89a6142a5ab |
15 | 5d975d224aa1 |
hex | 2e7c0375807b |
51110168854651 has 2 divisors, whose sum is σ = 51110168854652. Its totient is φ = 51110168854650.
The previous prime is 51110168854553. The next prime is 51110168854699. The reversal of 51110168854651 is 15645886101115.
51110168854651 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 not a de Polignac number, because 51110168854651 - 27 = 51110168854523 is a prime.
It is a super-2 number, since 2×511101688546512 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (51110168884651) 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, 25555084427325 + 25555084427326.
It is an arithmetic number, because the mean of its divisors is an integer number (25555084427326).
Almost surely, 251110168854651 is an apocalyptic number.
51110168854651 is a deficient number, since it is larger than the sum of its proper divisors (1).
51110168854651 is an equidigital number, since it uses as much as digits as its factorization.
51110168854651 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152000, while the sum is 52.
The spelling of 51110168854651 in words is "fifty-one trillion, one hundred ten billion, one hundred sixty-eight million, eight hundred fifty-four thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •