Base | Representation |
---|---|
bin | 101110110000011000… |
… | …001001110110000010 |
3 | 11210120210020100121110 |
4 | 232300120021312002 |
5 | 1310304130341200 |
6 | 35021400504150 |
7 | 3425044636131 |
oct | 566030116602 |
9 | 153523210543 |
10 | 50203762050 |
11 | 1a322795542 |
12 | 989117b056 |
13 | 49710434a0 |
14 | 2603811918 |
15 | 148c6e3b50 |
hex | bb0609d82 |
50203762050 has 192 divisors, whose sum is σ = 140131031040. Its totient is φ = 11812711680.
The previous prime is 50203762033. The next prime is 50203762069. The reversal of 50203762050 is 5026730205.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 50203761999 and 50203762017.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 3934581 + ... + 3947319.
It is an arithmetic number, because the mean of its divisors is an integer number (729849120).
Almost surely, 250203762050 is an apocalyptic number.
50203762050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 50203762050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (70065515520).
50203762050 is an abundant number, since it is smaller than the sum of its proper divisors (89927268990).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50203762050 is a wasteful number, since it uses less digits than its factorization.
50203762050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12857 (or 12852 counting only the distinct ones).
The product of its (nonzero) digits is 12600, while the sum is 30.
The spelling of 50203762050 in words is "fifty billion, two hundred three million, seven hundred sixty-two thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •