Base | Representation |
---|---|
bin | 101111011110101101… |
… | …100000100011000000 |
3 | 11212120221221211021100 |
4 | 233132231200203000 |
5 | 1313402131041000 |
6 | 35230450054400 |
7 | 3453234205410 |
oct | 573655404300 |
9 | 155527854240 |
10 | 50981112000 |
11 | 1a691566015 |
12 | 9a6957a400 |
13 | 4a660c5980 |
14 | 2678b62640 |
15 | 14d5a94a00 |
hex | bdeb608c0 |
50981112000 has 1344 divisors, whose sum is σ = 232616337408. Its totient is φ = 10368000000.
The previous prime is 50981111983. The next prime is 50981112029. The reversal of 50981112000 is 21118905.
It is a tau number, because it is divible by the number of its divisors (1344).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 203111875 + ... + 203112125.
It is an arithmetic number, because the mean of its divisors is an integer number (173077632).
Almost surely, 250981112000 is an apocalyptic number.
50981112000 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 50981112000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (116308168704).
50981112000 is an abundant number, since it is smaller than the sum of its proper divisors (181635225408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50981112000 is a wasteful number, since it uses less digits than its factorization.
50981112000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 335 (or 312 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 27.
The spelling of 50981112000 in words is "fifty billion, nine hundred eighty-one million, one hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •