Base | Representation |
---|---|
bin | 101111000000111100… |
… | …111100000001011001 |
3 | 11211022011111012010211 |
4 | 233000330330001121 |
5 | 1311341322341332 |
6 | 35105133011121 |
7 | 3434662363504 |
oct | 570074740131 |
9 | 154264435124 |
10 | 50481840217 |
11 | 1a455756806 |
12 | 994a323aa1 |
13 | 49b6837193 |
14 | 262c71a13b |
15 | 14a6d22447 |
hex | bc0f3c059 |
50481840217 has 4 divisors (see below), whose sum is σ = 50506007860. Its totient is φ = 50457672576.
The previous prime is 50481840209. The next prime is 50481840239. The reversal of 50481840217 is 71204818405.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 27772555801 + 22709284416 = 166651^2 + 150696^2 .
It is not a de Polignac number, because 50481840217 - 23 = 50481840209 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 50481840217.
It is not an unprimeable number, because it can be changed into a prime (50481840287) 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 3 ways as a sum of consecutive naturals, for example, 12080688 + ... + 12084865.
It is an arithmetic number, because the mean of its divisors is an integer number (12626501965).
Almost surely, 250481840217 is an apocalyptic number.
It is an amenable number.
50481840217 is a deficient number, since it is larger than the sum of its proper divisors (24167643).
50481840217 is a wasteful number, since it uses less digits than its factorization.
50481840217 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24167642.
The product of its (nonzero) digits is 71680, while the sum is 40.
The spelling of 50481840217 in words is "fifty billion, four hundred eighty-one million, eight hundred forty thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •