Base | Representation |
---|---|
bin | 101111100110101110… |
… | …100011100000000000 |
3 | 11212221100000201120100 |
4 | 233212232203200000 |
5 | 1314141043311333 |
6 | 35252052442400 |
7 | 3456456315312 |
oct | 574656434000 |
9 | 155840021510 |
10 | 51115603968 |
11 | 1a750475900 |
12 | 9aa6619400 |
13 | 4a87c24c10 |
14 | 268c9717b2 |
15 | 14e27ae213 |
hex | be6ba3800 |
51115603968 has 864 divisors, whose sum is σ = 183180357360. Its totient is φ = 13624934400.
The previous prime is 51115603963. The next prime is 51115603997. The reversal of 51115603968 is 86930651115.
51115603968 is a `hidden beast` number, since 51 + 1 + 1 + 560 + 39 + 6 + 8 = 666.
It is a super-2 number, since 2×511156039682 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51115603963) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 1188734955 + ... + 1188734997.
Almost surely, 251115603968 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 51115603968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (91590178680).
51115603968 is an abundant number, since it is smaller than the sum of its proper divisors (132064753392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51115603968 is a wasteful number, since it uses less digits than its factorization.
51115603968 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 147 (or 113 counting only the distinct ones).
The product of its (nonzero) digits is 194400, while the sum is 45.
The spelling of 51115603968 in words is "fifty-one billion, one hundred fifteen million, six hundred three thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •