Base | Representation |
---|---|
bin | 101110100100110101… |
… | …001101010000100000 |
3 | 11210002021201211211221 |
4 | 232210311031100200 |
5 | 1304410033122431 |
6 | 34550240544424 |
7 | 3420203265520 |
oct | 564465152040 |
9 | 153067654757 |
10 | 50010051616 |
11 | 1a233408a78 |
12 | 9838322114 |
13 | 493cb7bc25 |
14 | 25c5bc9680 |
15 | 147a6cd111 |
hex | ba4d4d420 |
50010051616 has 96 divisors (see below), whose sum is σ = 113650992000. Its totient is φ = 21218844672.
The previous prime is 50010051613. The next prime is 50010051647. The reversal of 50010051616 is 61615001005.
It is a super-2 number, since 2×500100516162 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (50010051613) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12109840 + ... + 12113968.
It is an arithmetic number, because the mean of its divisors is an integer number (1183864500).
Almost surely, 250010051616 is an apocalyptic number.
50010051616 is a gapful number since it is divisible by the number (56) 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 50010051616, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (56825496000).
50010051616 is an abundant number, since it is smaller than the sum of its proper divisors (63640940384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50010051616 is a wasteful number, since it uses less digits than its factorization.
50010051616 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4674 (or 4666 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 25.
The spelling of 50010051616 in words is "fifty billion, ten million, fifty-one thousand, six hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •