Base | Representation |
---|---|
bin | 10111001110110100000011… |
… | …10010010110110110000101 |
3 | 20200212211020022100212111201 |
4 | 23213122001302112312011 |
5 | 23144000142212332021 |
6 | 300352453403102501 |
7 | 13521610360213315 |
oct | 1347320162266605 |
9 | 220784208325451 |
10 | 51086518480261 |
11 | 1530674194a830 |
12 | 5890aab811a31 |
13 | 2267590444c24 |
14 | c8885a401445 |
15 | 5d8d26c96591 |
hex | 2e7681c96d85 |
51086518480261 has 16 divisors (see below), whose sum is σ = 55741760746560. Its totient is φ = 46433112887680.
The previous prime is 51086518480259. The next prime is 51086518480267. The reversal of 51086518480261 is 16208481568015.
51086518480261 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 51086518480261 - 21 = 51086518480259 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51086518480267) 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 15 ways as a sum of consecutive naturals, for example, 1605620025 + ... + 1605651841.
It is an arithmetic number, because the mean of its divisors is an integer number (3483860046660).
Almost surely, 251086518480261 is an apocalyptic number.
It is an amenable number.
51086518480261 is a deficient number, since it is larger than the sum of its proper divisors (4655242266299).
51086518480261 is a wasteful number, since it uses less digits than its factorization.
51086518480261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56084.
The product of its (nonzero) digits is 3686400, while the sum is 55.
The spelling of 51086518480261 in words is "fifty-one trillion, eighty-six billion, five hundred eighteen million, four hundred eighty thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •