Base | Representation |
---|---|
bin | 10111001101111000100101… |
… | …00100101100101000101011 |
3 | 20200202202211000021011112002 |
4 | 23212330102210230220223 |
5 | 23142434243442414301 |
6 | 300330053123041215 |
7 | 13516400165333453 |
oct | 1346742244545053 |
9 | 220682730234462 |
10 | 51054587857451 |
11 | 152a4146945262 |
12 | 588687a21020b |
13 | 22645720b6989 |
14 | c870ab7dad63 |
15 | 5d80a891116b |
hex | 2e6f1292ca2b |
51054587857451 has 2 divisors, whose sum is σ = 51054587857452. Its totient is φ = 51054587857450.
The previous prime is 51054587857447. The next prime is 51054587857453. The reversal of 51054587857451 is 15475878545015.
51054587857451 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 51054587857451 - 22 = 51054587857447 is a prime.
Together with 51054587857453, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (51054587857453) 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, 25527293928725 + 25527293928726.
It is an arithmetic number, because the mean of its divisors is an integer number (25527293928726).
Almost surely, 251054587857451 is an apocalyptic number.
51054587857451 is a deficient number, since it is larger than the sum of its proper divisors (1).
51054587857451 is an equidigital number, since it uses as much as digits as its factorization.
51054587857451 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 156800000, while the sum is 65.
The spelling of 51054587857451 in words is "fifty-one trillion, fifty-four billion, five hundred eighty-seven million, eight hundred fifty-seven thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •