Base | Representation |
---|---|
bin | 10111011110001111010101… |
… | …10100011101000100110000 |
3 | 20202202111100221000222001220 |
4 | 23233013222310131010300 |
5 | 23231141204233141102 |
6 | 301440153203025040 |
7 | 13605113341424352 |
oct | 1357075264350460 |
9 | 222674327028056 |
10 | 51616561615152 |
11 | 154a0508433126 |
12 | 595777606b180 |
13 | 22a556187b4a1 |
14 | ca637d69b0d2 |
15 | 5e79ea1c41bc |
hex | 2ef1ead1d130 |
51616561615152 has 160 divisors (see below), whose sum is σ = 140758315176960. Its totient is φ = 16282651176960.
The previous prime is 51616561615147. The next prime is 51616561615169. The reversal of 51616561615152 is 25151616561615.
It is a junction number, because it is equal to n+sod(n) for n = 51616561615095 and 51616561615104.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4940728 + ... + 11297960.
It is an arithmetic number, because the mean of its divisors is an integer number (879739469856).
Almost surely, 251616561615152 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 51616561615152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (70379157588480).
51616561615152 is an abundant number, since it is smaller than the sum of its proper divisors (89141753561808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51616561615152 is a wasteful number, since it uses less digits than its factorization.
51616561615152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6357411 (or 6357405 counting only the distinct ones).
The product of its digits is 1620000, while the sum is 51.
The spelling of 51616561615152 in words is "fifty-one trillion, six hundred sixteen billion, five hundred sixty-one million, six hundred fifteen thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •