Base | Representation |
---|---|
bin | 101111100001011101… |
… | …001010110011100000 |
3 | 11212201011121022122111 |
4 | 233201131022303200 |
5 | 1314000423112123 |
6 | 35235213045104 |
7 | 3454333464106 |
oct | 574135126340 |
9 | 155634538574 |
10 | 51027160288 |
11 | 1a705557855 |
12 | 9a80a86794 |
13 | 4a727c9490 |
14 | 2680d0bc76 |
15 | 14d9b3d90d |
hex | be174ace0 |
51027160288 has 96 divisors (see below), whose sum is σ = 115389689184. Its totient is φ = 22003433472.
The previous prime is 51027160241. The next prime is 51027160291. The reversal of 51027160288 is 88206172015.
51027160288 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 51027160288.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 942531 + ... + 995197.
It is an arithmetic number, because the mean of its divisors is an integer number (1201975929).
Almost surely, 251027160288 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 51027160288, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (57694844592).
51027160288 is an abundant number, since it is smaller than the sum of its proper divisors (64362528896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51027160288 is a wasteful number, since it uses less digits than its factorization.
51027160288 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52844 (or 52836 counting only the distinct ones).
The product of its (nonzero) digits is 53760, while the sum is 40.
The spelling of 51027160288 in words is "fifty-one billion, twenty-seven million, one hundred sixty thousand, two hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •