Base | Representation |
---|---|
bin | 101110100100110110… |
… | …100101010001011000 |
3 | 11210002022102011100221 |
4 | 232210312211101120 |
5 | 1304410131141440 |
6 | 34550252405424 |
7 | 3420206326534 |
oct | 564466452130 |
9 | 153068364327 |
10 | 50010412120 |
11 | 1a233634909 |
12 | 9838476874 |
13 | 493cc77046 |
14 | 25c5c80bc4 |
15 | 147a74ed4a |
hex | ba4da5458 |
50010412120 has 128 divisors (see below), whose sum is σ = 118882209600. Its totient is φ = 18909628416.
The previous prime is 50010412117. The next prime is 50010412121. The reversal of 50010412120 is 2121401005.
It is a junction number, because it is equal to n+sod(n) for n = 50010412094 and 50010412103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50010412121) 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 31 ways as a sum of consecutive naturals, for example, 12535086 + ... + 12539074.
Almost surely, 250010412120 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 50010412120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (59441104800).
50010412120 is an abundant number, since it is smaller than the sum of its proper divisors (68871797480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50010412120 is a wasteful number, since it uses less digits than its factorization.
50010412120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4277 (or 4273 counting only the distinct ones).
The product of its (nonzero) digits is 80, while the sum is 16.
Adding to 50010412120 its reverse (2121401005), we get a palindrome (52131813125).
The spelling of 50010412120 in words is "fifty billion, ten million, four hundred twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •