Base | Representation |
---|---|
bin | 101111000010000101… |
… | …110111111101100101 |
3 | 11211100111110120200200 |
4 | 233002011313331211 |
5 | 1311411221210401 |
6 | 35111054501113 |
7 | 3435314035554 |
oct | 570205677545 |
9 | 154314416620 |
10 | 50500960101 |
11 | 1a465525869 |
12 | 9954804799 |
13 | 49ba79cb17 |
14 | 2631095d9b |
15 | 14a884c686 |
hex | bc2177f65 |
50500960101 has 12 divisors (see below), whose sum is σ = 72953444928. Its totient is φ = 33663792744.
The previous prime is 50500960079. The next prime is 50500960109. The reversal of 50500960101 is 10106900505.
50500960101 is a `hidden beast` number, since 5 + 0 + 50 + 0 + 9 + 601 + 0 + 1 = 666.
It is not a de Polignac number, because 50500960101 - 27 = 50500959973 is a prime.
It is a super-2 number, since 2×505009601012 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50500960109) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 200275 + ... + 375648.
It is an arithmetic number, because the mean of its divisors is an integer number (6079453744).
Almost surely, 250500960101 is an apocalyptic number.
It is an amenable number.
50500960101 is a deficient number, since it is larger than the sum of its proper divisors (22452484827).
50500960101 is a wasteful number, since it uses less digits than its factorization.
50500960101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 585672 (or 585669 counting only the distinct ones).
The product of its (nonzero) digits is 1350, while the sum is 27.
The spelling of 50500960101 in words is "fifty billion, five hundred million, nine hundred sixty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •