Base | Representation |
---|---|
bin | 10111001111101011001011… |
… | …11010001111100011000111 |
3 | 20200222122121222111010110110 |
4 | 23213311211322033203013 |
5 | 23144441301040302201 |
6 | 300414230323124103 |
7 | 13524005665212423 |
oct | 1347654572174307 |
9 | 220878558433413 |
10 | 51116115556551 |
11 | 1531824a701261 |
12 | 589678b813633 |
13 | 226a2c91b3a16 |
14 | c8a067123b83 |
15 | 5d99aa3306d6 |
hex | 2e7d65e8f8c7 |
51116115556551 has 8 divisors (see below), whose sum is σ = 68193174615664. Its totient is φ = 34058233434240.
The previous prime is 51116115556489. The next prime is 51116115556589. The reversal of 51116115556551 is 15565551161115.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 51116115556551 - 215 = 51116115523783 is a prime.
It is a super-2 number, since 2×511161155565512 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 51116115556551.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51116115556591) 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, 4794227980 + ... + 4794238641.
It is an arithmetic number, because the mean of its divisors is an integer number (8524146826958).
Almost surely, 251116115556551 is an apocalyptic number.
51116115556551 is a deficient number, since it is larger than the sum of its proper divisors (17077059059113).
51116115556551 is a wasteful number, since it uses less digits than its factorization.
51116115556551 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9588468401.
The product of its digits is 562500, while the sum is 48.
The spelling of 51116115556551 in words is "fifty-one trillion, one hundred sixteen billion, one hundred fifteen million, five hundred fifty-six thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •