Base | Representation |
---|---|
bin | 1100000010101… |
… | …0010110001101 |
3 | 10112000220222022 |
4 | 3000222112031 |
5 | 100412130401 |
6 | 5002255525 |
7 | 1152200123 |
oct | 300522615 |
9 | 115026868 |
10 | 50505101 |
11 | 26566259 |
12 | 14ab75a5 |
13 | a60429a |
14 | 69c9913 |
15 | 467971b |
hex | 302a58d |
50505101 has 8 divisors (see below), whose sum is σ = 50988960. Its totient is φ = 50023792.
The previous prime is 50505089. The next prime is 50505109. The reversal of 50505101 is 10150505.
50505101 = T358 + T359 + ... + T703.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50505101 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 50505101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50505109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 76310 + ... + 76968.
It is an arithmetic number, because the mean of its divisors is an integer number (6373620).
Almost surely, 250505101 is an apocalyptic number.
It is an amenable number.
50505101 is a deficient number, since it is larger than the sum of its proper divisors (483859).
50505101 is a wasteful number, since it uses less digits than its factorization.
50505101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1275.
The product of its (nonzero) digits is 125, while the sum is 17.
The square root of 50505101 is about 7106.6940978207. The cubic root of 50505101 is about 369.6395344986.
Adding to 50505101 its reverse (10150505), we get a palindrome (60655606).
The spelling of 50505101 in words is "fifty million, five hundred five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •