Base | Representation |
---|---|
bin | 101110101100101010… |
… | …101001001001100000 |
3 | 11210102110002010010121 |
4 | 232230222221021200 |
5 | 1310142211000000 |
6 | 35011254210024 |
7 | 3423360501124 |
oct | 565452511140 |
9 | 153373063117 |
10 | 50141500000 |
11 | 1a2a062a0a9 |
12 | 9874353914 |
13 | 4961183a37 |
14 | 25d9445584 |
15 | 1486ee5b1a |
hex | bacaa9260 |
50141500000 has 252 divisors, whose sum is σ = 131456676708. Its totient is φ = 18822400000.
The previous prime is 50141499977. The next prime is 50141500007. The reversal of 50141500000 is 514105.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50141500007) by changing a digit.
It is a polite number, since it can be written in 41 ways as a sum of consecutive naturals, for example, 144499827 + ... + 144500173.
It is an arithmetic number, because the mean of its divisors is an integer number (521653479).
Almost surely, 250141500000 is an apocalyptic number.
50141500000 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 50141500000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (65728338354).
50141500000 is an abundant number, since it is smaller than the sum of its proper divisors (81315176708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50141500000 is an frugal number, since it uses more digits than its factorization.
50141500000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 421 (or 371 counting only the distinct ones).
The product of its (nonzero) digits is 100, while the sum is 16.
The spelling of 50141500000 in words is "fifty billion, one hundred forty-one million, five hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •