Base | Representation |
---|---|
bin | 101111101011000110… |
… | …000001000100110100 |
3 | 11220010102212200110100 |
4 | 233223012001010310 |
5 | 1314313322111114 |
6 | 35303230554100 |
7 | 3461336105316 |
oct | 575306010464 |
9 | 156112780410 |
10 | 51188863284 |
11 | 1a788862699 |
12 | 9b07068930 |
13 | 4a9a165120 |
14 | 26985a17b6 |
15 | 14e8e30909 |
hex | beb181134 |
51188863284 has 72 divisors (see below), whose sum is σ = 139514618880. Its totient is φ = 15731525952.
The previous prime is 51188863223. The next prime is 51188863307. The reversal of 51188863284 is 48236888115.
It is a Smith number, since the sum of its digits (54) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 51188863284.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 327469 + ... + 457835.
It is an arithmetic number, because the mean of its divisors is an integer number (1937703040).
Almost surely, 251188863284 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 51188863284, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (69757309440).
51188863284 is an abundant number, since it is smaller than the sum of its proper divisors (88325755596).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51188863284 is a wasteful number, since it uses less digits than its factorization.
51188863284 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 131229 (or 131224 counting only the distinct ones).
The product of its digits is 2949120, while the sum is 54.
The spelling of 51188863284 in words is "fifty-one billion, one hundred eighty-eight million, eight hundred sixty-three thousand, two hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •