Base | Representation |
---|---|
bin | 101110101000001101… |
… | …001100101100010000 |
3 | 11210020020021110222000 |
4 | 232220031030230100 |
5 | 1310014032004100 |
6 | 35000022314000 |
7 | 3421461456633 |
oct | 565015145420 |
9 | 153206243860 |
10 | 50066672400 |
11 | 1a262371008 |
12 | 9853288900 |
13 | 494b814a54 |
14 | 25cd527c1a |
15 | 1480664900 |
hex | ba834cb10 |
50066672400 has 240 divisors, whose sum is σ = 180712897920. Its totient is φ = 13162867200.
The previous prime is 50066672393. The next prime is 50066672423. The reversal of 50066672400 is 427666005.
It is a tau number, because it is divible by the number of its divisors (240).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 734154 + ... + 799446.
It is an arithmetic number, because the mean of its divisors is an integer number (752970408).
Almost surely, 250066672400 is an apocalyptic number.
50066672400 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 50066672400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (90356448960).
50066672400 is an abundant number, since it is smaller than the sum of its proper divisors (130646225520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50066672400 is a wasteful number, since it uses less digits than its factorization.
50066672400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65391 (or 65374 counting only the distinct ones).
The product of its (nonzero) digits is 60480, while the sum is 36.
The spelling of 50066672400 in words is "fifty billion, sixty-six million, six hundred seventy-two thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.702 sec. • engine limits •