Base | Representation |
---|---|
bin | 101110110011100010… |
… | …001010000011100000 |
3 | 11210201110212200202212 |
4 | 232303202022003200 |
5 | 1310411204403000 |
6 | 35030531501252 |
7 | 3426260015621 |
oct | 566342120340 |
9 | 153643780685 |
10 | 50256716000 |
11 | 1a34a673637 |
12 | 98a6a57828 |
13 | 497bcc429a |
14 | 260a877a48 |
15 | 14921a3c35 |
hex | bb388a0e0 |
50256716000 has 96 divisors (see below), whose sum is σ = 123571217952. Its totient is φ = 20087961600.
The previous prime is 50256715969. The next prime is 50256716017. The reversal of 50256716000 is 61765205.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (32).
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, 6664232 + ... + 6671768.
It is an arithmetic number, because the mean of its divisors is an integer number (1287200187).
Almost surely, 250256716000 is an apocalyptic number.
50256716000 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 50256716000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (61785608976).
50256716000 is an abundant number, since it is smaller than the sum of its proper divisors (73314501952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50256716000 is a wasteful number, since it uses less digits than its factorization.
50256716000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9229 (or 9211 counting only the distinct ones).
The product of its (nonzero) digits is 12600, while the sum is 32.
The spelling of 50256716000 in words is "fifty billion, two hundred fifty-six million, seven hundred sixteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •