Base | Representation |
---|---|
bin | 101110100110101111… |
… | …100000000011111000 |
3 | 11210011112001120221220 |
4 | 232212233200003320 |
5 | 1304441240011300 |
6 | 34553344032040 |
7 | 3421042630005 |
oct | 564657400370 |
9 | 153145046856 |
10 | 50042110200 |
11 | 1a24a515075 |
12 | 9847002620 |
13 | 49466c4bc4 |
14 | 25ca1728ac |
15 | 147d411da0 |
hex | ba6be00f8 |
50042110200 has 48 divisors (see below), whose sum is σ = 155130543480. Its totient is φ = 13344562560.
The previous prime is 50042110141. The next prime is 50042110201. The reversal of 50042110200 is 201124005.
50042110200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 50042110200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50042110201) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 41701159 + ... + 41702358.
Almost surely, 250042110200 is an apocalyptic number.
50042110200 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
50042110200 is an abundant number, since it is smaller than the sum of its proper divisors (105088433280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50042110200 is a wasteful number, since it uses less digits than its factorization.
50042110200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 83403536 (or 83403527 counting only the distinct ones).
The product of its (nonzero) digits is 80, while the sum is 15.
Adding to 50042110200 its reverse (201124005), we get a palindrome (50243234205).
The spelling of 50042110200 in words is "fifty billion, forty-two million, one hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •