Base | Representation |
---|---|
bin | 101111100001011100… |
… | …111111001100000001 |
3 | 11212201011111220101011 |
4 | 233201130333030001 |
5 | 1314000420101310 |
6 | 35235212040521 |
7 | 3454333205302 |
oct | 574134771401 |
9 | 155634456334 |
10 | 51027112705 |
11 | 1a705525028 |
12 | 9a80a63141 |
13 | 4a727b091a |
14 | 2680cd87a9 |
15 | 14d9b2e78a |
hex | be173f301 |
51027112705 has 32 divisors (see below), whose sum is σ = 65904516000. Its totient is φ = 37790810112.
The previous prime is 51027112679. The next prime is 51027112711. The reversal of 51027112705 is 50721172015.
It can be written as a sum of positive squares in 16 ways, for example, as 31687204081 + 19339908624 = 178009^2 + 139068^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51027112705 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1442571 + ... + 1477519.
It is an arithmetic number, because the mean of its divisors is an integer number (2059516125).
Almost surely, 251027112705 is an apocalyptic number.
It is an amenable number.
51027112705 is a deficient number, since it is larger than the sum of its proper divisors (14877403295).
51027112705 is a wasteful number, since it uses less digits than its factorization.
51027112705 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35253.
The product of its (nonzero) digits is 4900, while the sum is 31.
The spelling of 51027112705 in words is "fifty-one billion, twenty-seven million, one hundred twelve thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •