Base | Representation |
---|---|
bin | 110000010011111101… |
… | …100111101110000000 |
3 | 11221220020002001210120 |
4 | 300103331213232000 |
5 | 1322214334400003 |
6 | 35455243100240 |
7 | 3514333133223 |
oct | 602375475600 |
9 | 157806061716 |
10 | 51874528128 |
11 | 1aaaa900855 |
12 | a078811680 |
13 | 4b79225677 |
14 | 27216875ba |
15 | 1539220853 |
hex | c13f67b80 |
51874528128 has 128 divisors (see below), whose sum is σ = 143081316000. Its totient is φ = 16632225792.
The previous prime is 51874528117. The next prime is 51874528151. The reversal of 51874528128 is 82182547815.
51874528128 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (128).
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, 2986926 + ... + 3004242.
Almost surely, 251874528128 is an apocalyptic number.
51874528128 is a gapful number since it is divisible by the number (58) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 51874528128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (71540658000).
51874528128 is an abundant number, since it is smaller than the sum of its proper divisors (91206787872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51874528128 is a wasteful number, since it uses less digits than its factorization.
51874528128 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17632 (or 17620 counting only the distinct ones).
The product of its digits is 1433600, while the sum is 51.
The spelling of 51874528128 in words is "fifty-one billion, eight hundred seventy-four million, five hundred twenty-eight thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •