Base | Representation |
---|---|
bin | 10111001101111001011101… |
… | …01111101101001111111000 |
3 | 20200202211000221122011212210 |
4 | 23212330232233231033320 |
5 | 23142441230442134332 |
6 | 300330212045335120 |
7 | 13516414664641413 |
oct | 1346745657551770 |
9 | 220684027564783 |
10 | 51055060505592 |
11 | 152a436971a860 |
12 | 58869905674a0 |
13 | 2264618cb3230 |
14 | c871144b2b7a |
15 | 5d80d5174ecc |
hex | 2e6f2ebed3f8 |
51055060505592 has 128 divisors (see below), whose sum is σ = 149979092901120. Its totient is φ = 14278548480000.
The previous prime is 51055060505569. The next prime is 51055060505633. The reversal of 51055060505592 is 29550506055015.
It is a congruent number.
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, 17637592 + ... + 20327192.
It is an arithmetic number, because the mean of its divisors is an integer number (1171711663290).
Almost surely, 251055060505592 is an apocalyptic number.
51055060505592 is a gapful number since it is divisible by the number (52) 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 51055060505592, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (74989546450560).
51055060505592 is an abundant number, since it is smaller than the sum of its proper divisors (98924032395528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51055060505592 is a wasteful number, since it uses less digits than its factorization.
51055060505592 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2695165 (or 2695161 counting only the distinct ones).
The product of its (nonzero) digits is 1687500, while the sum is 48.
The spelling of 51055060505592 in words is "fifty-one trillion, fifty-five billion, sixty million, five hundred five thousand, five hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •