Base | Representation |
---|---|
bin | 101111001000101000… |
… | …000111110001011010 |
3 | 11211122010202220210120 |
4 | 233020220013301122 |
5 | 1312122303213200 |
6 | 35130012454110 |
7 | 3441115003512 |
oct | 571050076132 |
9 | 154563686716 |
10 | 50610601050 |
11 | 1a511401719 |
12 | 998547a336 |
13 | 4a0740a919 |
14 | 2641876842 |
15 | 14b32a89a0 |
hex | bc8a07c5a |
50610601050 has 24 divisors (see below), whose sum is σ = 125514290976. Its totient is φ = 13496160240.
The previous prime is 50610601039. The next prime is 50610601051. The reversal of 50610601050 is 5010601605.
It is a super-2 number, since 2×506106010502 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 50610601050.
It is not an unprimeable number, because it can be changed into a prime (50610601051) 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 11 ways as a sum of consecutive naturals, for example, 168701854 + ... + 168702153.
It is an arithmetic number, because the mean of its divisors is an integer number (5229762124).
Almost surely, 250610601050 is an apocalyptic number.
50610601050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
50610601050 is an abundant number, since it is smaller than the sum of its proper divisors (74903689926).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50610601050 is a wasteful number, since it uses less digits than its factorization.
50610601050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 337404022 (or 337404017 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 24.
The spelling of 50610601050 in words is "fifty billion, six hundred ten million, six hundred one thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •