Base | Representation |
---|---|
bin | 10111001110101001011111… |
… | …01110101011010011000011 |
3 | 20200212021121001010111102010 |
4 | 23213110233232223103003 |
5 | 23143402033241111301 |
6 | 300350114515424003 |
7 | 13521320000653314 |
oct | 1347245756532303 |
9 | 220767531114363 |
10 | 51080846816451 |
11 | 153042a1397871 |
12 | 588b9882b5003 |
13 | 2266b983b883a |
14 | c8847d06060b |
15 | 5d8ae3db85d6 |
hex | 2e752fbab4c3 |
51080846816451 has 8 divisors (see below), whose sum is σ = 69124330020544. Its totient is φ = 33545630745000.
The previous prime is 51080846816449. The next prime is 51080846816491. The reversal of 51080846816451 is 15461864808015.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 51080846816451 - 21 = 51080846816449 is a prime.
It is a super-2 number, since 2×510808468164512 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 51080846816391 and 51080846816400.
It is not an unprimeable number, because it can be changed into a prime (51080846816431) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 127066782925 + ... + 127066783326.
It is an arithmetic number, because the mean of its divisors is an integer number (8640541252568).
Almost surely, 251080846816451 is an apocalyptic number.
51080846816451 is a deficient number, since it is larger than the sum of its proper divisors (18043483204093).
51080846816451 is a wasteful number, since it uses less digits than its factorization.
51080846816451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 254133566321.
The product of its (nonzero) digits is 7372800, while the sum is 57.
The spelling of 51080846816451 in words is "fifty-one trillion, eighty billion, eight hundred forty-six million, eight hundred sixteen thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •