Base | Representation |
---|---|
bin | 101110100100010100… |
… | …111111100110001010 |
3 | 11210001200211211002020 |
4 | 232210110333212022 |
5 | 1304400402411200 |
6 | 34545335545310 |
7 | 3420041435013 |
oct | 564424774612 |
9 | 153050754066 |
10 | 50001607050 |
11 | 1a22967049a |
12 | 983552b236 |
13 | 493b1b3345 |
14 | 25c4a2c00a |
15 | 1479ab0ea0 |
hex | ba453f98a |
50001607050 has 48 divisors (see below), whose sum is σ = 124075859232. Its totient is φ = 13326033600.
The previous prime is 50001607049. The next prime is 50001607069. The reversal of 50001607050 is 5070610005.
It is a self number, because there is not a number n which added to its sum of digits gives 50001607050.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 165417 + ... + 356883.
It is an arithmetic number, because the mean of its divisors is an integer number (2584913734).
Almost surely, 250001607050 is an apocalyptic number.
50001607050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
50001607050 is an abundant number, since it is smaller than the sum of its proper divisors (74074252182).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50001607050 is a wasteful number, since it uses less digits than its factorization.
50001607050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 193223 (or 193218 counting only the distinct ones).
The product of its (nonzero) digits is 1050, while the sum is 24.
The spelling of 50001607050 in words is "fifty billion, one million, six hundred seven thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •