Base | Representation |
---|---|
bin | 101110100111000011… |
… | …100010110001101000 |
3 | 11210011212221112002111 |
4 | 232213003202301220 |
5 | 1304444111123300 |
6 | 34554052412104 |
7 | 3421135401541 |
oct | 564703426150 |
9 | 153155845074 |
10 | 50047364200 |
11 | 1a252483519 |
12 | 9848917034 |
13 | 4947814492 |
14 | 25cab3d4c8 |
15 | 147daed9ba |
hex | ba70e2c68 |
50047364200 has 192 divisors, whose sum is σ = 130025606400. Its totient is φ = 17803468800.
The previous prime is 50047364197. The next prime is 50047364209. The reversal of 50047364200 is 246374005.
It is not an unprimeable number, because it can be changed into a prime (50047364209) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 33655857 + ... + 33657343.
It is an arithmetic number, because the mean of its divisors is an integer number (677216700).
Almost surely, 250047364200 is an apocalyptic number.
50047364200 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 50047364200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (65012803200).
50047364200 is an abundant number, since it is smaller than the sum of its proper divisors (79978242200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50047364200 is a wasteful number, since it uses less digits than its factorization.
50047364200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2060 (or 2051 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 31.
The spelling of 50047364200 in words is "fifty billion, forty-seven million, three hundred sixty-four thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.146 sec. • engine limits •