Base | Representation |
---|---|
bin | 10111001111000111000011… |
… | …11001011010111011111111 |
3 | 20200220210120022222102222222 |
4 | 23213203201321122323333 |
5 | 23144132041021114414 |
6 | 300401302015555555 |
7 | 13522421243164151 |
oct | 1347434171327377 |
9 | 220823508872888 |
10 | 51096720879359 |
11 | 1530aaa7936221 |
12 | 5892a7852bbbb |
13 | 226852804967c |
14 | c891473acad1 |
15 | 5d92227d468e |
hex | 2e78e1e5aeff |
51096720879359 has 6 divisors (see below), whose sum is σ = 52798172564160. Its totient is φ = 49448439559740.
The previous prime is 51096720879317. The next prime is 51096720879389. The reversal of 51096720879359 is 95397802769015.
It is not a de Polignac number, because 51096720879359 - 232 = 51092425912063 is a prime.
It is a super-2 number, since 2×510967208793592 (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 = 51096720879292 and 51096720879301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51096720879389) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 26585181599 + ... + 26585183520.
It is an arithmetic number, because the mean of its divisors is an integer number (8799695427360).
Almost surely, 251096720879359 is an apocalyptic number.
51096720879359 is a deficient number, since it is larger than the sum of its proper divisors (1701451684801).
51096720879359 is an equidigital number, since it uses as much as digits as its factorization.
51096720879359 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53170365181 (or 53170365150 counting only the distinct ones).
The product of its (nonzero) digits is 257191200, while the sum is 71.
The spelling of 51096720879359 in words is "fifty-one trillion, ninety-six billion, seven hundred twenty million, eight hundred seventy-nine thousand, three hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.730 sec. • engine limits •