Base | Representation |
---|---|
bin | 101110101010010110… |
… | …010111111011010111 |
3 | 11210022201221102110122 |
4 | 232222112113323113 |
5 | 1310102233212101 |
6 | 35003345142155 |
7 | 3422406226565 |
oct | 565226277327 |
9 | 153281842418 |
10 | 50102632151 |
11 | 1a2806a2110 |
12 | 986332a95b |
13 | 49560c5600 |
14 | 25d4208a35 |
15 | 14838b951b |
hex | baa597ed7 |
50102632151 has 24 divisors (see below), whose sum is σ = 59209702704. Its totient is φ = 42026799360.
The previous prime is 50102632133. The next prime is 50102632189. The reversal of 50102632151 is 15123620105.
It is not a de Polignac number, because 50102632151 - 226 = 50035523287 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 50102632151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50102632051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6608675 + ... + 6616251.
It is an arithmetic number, because the mean of its divisors is an integer number (2467070946).
Almost surely, 250102632151 is an apocalyptic number.
50102632151 is a deficient number, since it is larger than the sum of its proper divisors (9107070553).
50102632151 is a wasteful number, since it uses less digits than its factorization.
50102632151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11171 (or 11158 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 26.
The spelling of 50102632151 in words is "fifty billion, one hundred two million, six hundred thirty-two thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •