Base | Representation |
---|---|
bin | 101110101010001100… |
… | …010110100011001001 |
3 | 11210022112222221210011 |
4 | 232222030112203021 |
5 | 1310101100130230 |
6 | 35003212551521 |
7 | 3422345005465 |
oct | 565214264311 |
9 | 153275887704 |
10 | 50100005065 |
11 | 1a27a168370 |
12 | 98624825a1 |
13 | 49556b5916 |
14 | 25d3b234a5 |
15 | 148354ae2a |
hex | baa3168c9 |
50100005065 has 16 divisors (see below), whose sum is σ = 65964580416. Its totient is φ = 36225745600.
The previous prime is 50100005051. The next prime is 50100005069. The reversal of 50100005065 is 56050000105.
It is not a de Polignac number, because 50100005065 - 27 = 50100004937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50100005069) 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 15 ways as a sum of consecutive naturals, for example, 2623171 + ... + 2642200.
It is an arithmetic number, because the mean of its divisors is an integer number (4122786276).
Almost surely, 250100005065 is an apocalyptic number.
50100005065 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
50100005065 is a deficient number, since it is larger than the sum of its proper divisors (15864575351).
50100005065 is a wasteful number, since it uses less digits than its factorization.
50100005065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5265560.
The product of its (nonzero) digits is 750, while the sum is 22.
The spelling of 50100005065 in words is "fifty billion, one hundred million, five thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •