Base | Representation |
---|---|
bin | 10111001110110101110000… |
… | …11111111101110110010001 |
3 | 20200212220121021121100010021 |
4 | 23213122320133331312101 |
5 | 23144004032204444121 |
6 | 300353124433303441 |
7 | 13521642204362161 |
oct | 1347327037756621 |
9 | 220786537540107 |
10 | 51087436406161 |
11 | 15307073006081 |
12 | 5891107104b81 |
13 | 22676a867694c |
14 | c889062a65a1 |
15 | 5d8d7c664641 |
hex | 2e76b87fdd91 |
51087436406161 has 8 divisors (see below), whose sum is σ = 51277591598400. Its totient is φ = 50897282985360.
The previous prime is 51087436406137. The next prime is 51087436406197. The reversal of 51087436406161 is 16160463478015.
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 51087436406161 - 237 = 50949997452689 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 51087436406099 and 51087436406108.
It is not an unprimeable number, because it can be changed into a prime (51087436406131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 97841500 + ... + 98362258.
It is an arithmetic number, because the mean of its divisors is an integer number (6409698949800).
Almost surely, 251087436406161 is an apocalyptic number.
It is an amenable number.
51087436406161 is a deficient number, since it is larger than the sum of its proper divisors (190155192239).
51087436406161 is a wasteful number, since it uses less digits than its factorization.
51087436406161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 885719.
The product of its (nonzero) digits is 2903040, while the sum is 52.
The spelling of 51087436406161 in words is "fifty-one trillion, eighty-seven billion, four hundred thirty-six million, four hundred six thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •