Base | Representation |
---|---|
bin | 101111101001001011… |
… | …011110011111011001 |
3 | 11220001012102122200012 |
4 | 233221023132133121 |
5 | 1314232111140212 |
6 | 35300122251305 |
7 | 3460466054513 |
oct | 575113363731 |
9 | 156035378605 |
10 | 51156740057 |
11 | 1a771711a75 |
12 | 9ab8356b35 |
13 | 4a935c88b7 |
14 | 26941dcbb3 |
15 | 14e61d7922 |
hex | be92de7d9 |
51156740057 has 8 divisors (see below), whose sum is σ = 53917639200. Its totient is φ = 48402684864.
The previous prime is 51156740029. The next prime is 51156740087. The reversal of 51156740057 is 75004765115.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 51156740057 - 230 = 50082998233 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 51156739996 and 51156740023.
It is not an unprimeable number, because it can be changed into a prime (51156740087) 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 in 7 ways as a sum of consecutive naturals, for example, 1695632 + ... + 1725537.
It is an arithmetic number, because the mean of its divisors is an integer number (6739704900).
Almost surely, 251156740057 is an apocalyptic number.
It is an amenable number.
51156740057 is a deficient number, since it is larger than the sum of its proper divisors (2760899143).
51156740057 is a wasteful number, since it uses less digits than its factorization.
51156740057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3421975.
The product of its (nonzero) digits is 147000, while the sum is 41.
The spelling of 51156740057 in words is "fifty-one billion, one hundred fifty-six million, seven hundred forty thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •