Base | Representation |
---|---|
bin | 10111001110000010110000… |
… | …11110000110011011010100 |
3 | 20200210021221001121012202012 |
4 | 23213001120132012123110 |
5 | 23143031443202004000 |
6 | 300332355441403352 |
7 | 13516652526461654 |
oct | 1347013036063324 |
9 | 220707831535665 |
10 | 51060055500500 |
11 | 152a64a2219422 |
12 | 5887945339558 |
13 | 2264c33aab917 |
14 | c87469a30364 |
15 | 5d82c893d735 |
hex | 2e70587866d4 |
51060055500500 has 192 divisors, whose sum is σ = 120100974739200. Its totient is φ = 18892895129600.
The previous prime is 51060055500499. The next prime is 51060055500521. The reversal of 51060055500500 is 500555006015.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3775786739 + ... + 3775800261.
It is an arithmetic number, because the mean of its divisors is an integer number (625525910100).
Almost surely, 251060055500500 is an apocalyptic number.
51060055500500 is a gapful number since it is divisible by the number (50) 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 51060055500500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (60050487369600).
51060055500500 is an abundant number, since it is smaller than the sum of its proper divisors (69040919238700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51060055500500 is a wasteful number, since it uses less digits than its factorization.
51060055500500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21147 (or 21135 counting only the distinct ones).
The product of its (nonzero) digits is 18750, while the sum is 32.
The spelling of 51060055500500 in words is "fifty-one trillion, sixty billion, fifty-five million, five hundred thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •