Base | Representation |
---|---|
bin | 10111001111101011001111… |
… | …11101101000111110011110 |
3 | 20200222122201101022010010202 |
4 | 23213311213331220332132 |
5 | 23144441333400022231 |
6 | 300414233553303502 |
7 | 13524006564043256 |
oct | 1347654775507636 |
9 | 220878641263122 |
10 | 51116150001566 |
11 | 15318268098311 |
12 | 589679b264b92 |
13 | 226a303383ca0 |
14 | c8a06b92c966 |
15 | 5d99ad3865cb |
hex | 2e7d67f68f9e |
51116150001566 has 32 divisors (see below), whose sum is σ = 82674813170880. Its totient is φ = 23562766116864.
The previous prime is 51116150001487. The next prime is 51116150001589. The reversal of 51116150001566 is 66510005161115.
It is a happy number.
It is a super-2 number, since 2×511161500015662 (a number of 28 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 553440446 + ... + 553532798.
It is an arithmetic number, because the mean of its divisors is an integer number (2583587911590).
Almost surely, 251116150001566 is an apocalyptic number.
51116150001566 is a deficient number, since it is larger than the sum of its proper divisors (31558663169314).
51116150001566 is a wasteful number, since it uses less digits than its factorization.
51116150001566 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118580.
The product of its (nonzero) digits is 27000, while the sum is 38.
The spelling of 51116150001566 in words is "fifty-one trillion, one hundred sixteen billion, one hundred fifty million, one thousand, five hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •