Base | Representation |
---|---|
bin | 110000000001101111… |
… | …010001010100110100 |
3 | 11221002220202021102012 |
4 | 300001233101110310 |
5 | 1321103101322000 |
6 | 35405041503352 |
7 | 3503631240113 |
oct | 600157212464 |
9 | 157086667365 |
10 | 51568776500 |
11 | 1a96325905a |
12 | 9bb2341b58 |
13 | 4b2aa92947 |
14 | 26d2c17c7a |
15 | 151c477735 |
hex | c01bd1534 |
51568776500 has 48 divisors (see below), whose sum is σ = 112758260160. Its totient is φ = 20603325600.
The previous prime is 51568776473. The next prime is 51568776533. The reversal of 51568776500 is 567786515.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (50).
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, 369467 + ... + 489533.
It is an arithmetic number, because the mean of its divisors is an integer number (2349130420).
Almost surely, 251568776500 is an apocalyptic number.
51568776500 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 51568776500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (56379130080).
51568776500 is an abundant number, since it is smaller than the sum of its proper divisors (61189483660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51568776500 is a wasteful number, since it uses less digits than its factorization.
51568776500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120945 (or 120933 counting only the distinct ones).
The product of its (nonzero) digits is 1764000, while the sum is 50.
The spelling of 51568776500 in words is "fifty-one billion, five hundred sixty-eight million, seven hundred seventy-six thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •