Base | Representation |
---|---|
bin | 101111010100111010… |
… | …101101110011010000 |
3 | 11212011111210000022210 |
4 | 233110322231303100 |
5 | 1313033100131000 |
6 | 35202300232120 |
7 | 3446200455456 |
oct | 572472556320 |
9 | 155144700283 |
10 | 50816802000 |
11 | 1a60783a528 |
12 | 9a2253b640 |
13 | 4a3b056513 |
14 | 2660dd09d6 |
15 | 14c643a350 |
hex | bd4eadcd0 |
50816802000 has 160 divisors (see below), whose sum is σ = 164362872960. Its totient is φ = 13507353600.
The previous prime is 50816801963. The next prime is 50816802007. The reversal of 50816802000 is 20861805.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50816802007) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1864471 + ... + 1891529.
It is an arithmetic number, because the mean of its divisors is an integer number (1027267956).
Almost surely, 250816802000 is an apocalyptic number.
50816802000 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 50816802000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (82181436480).
50816802000 is an abundant number, since it is smaller than the sum of its proper divisors (113546070960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50816802000 is a wasteful number, since it uses less digits than its factorization.
50816802000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27398 (or 27382 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 30.
The spelling of 50816802000 in words is "fifty billion, eight hundred sixteen million, eight hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.182 sec. • engine limits •