Base | Representation |
---|---|
bin | 1011111011110… |
… | …0100101010001 |
3 | 10111012002020121 |
4 | 2332330211101 |
5 | 100303234010 |
6 | 4544510241 |
7 | 1145315263 |
oct | 276744521 |
9 | 114162217 |
10 | 50055505 |
11 | 26289495 |
12 | 1491b381 |
13 | a4a7756 |
14 | 690db33 |
15 | 45db3da |
hex | 2fbc951 |
50055505 has 4 divisors (see below), whose sum is σ = 60066612. Its totient is φ = 40044400.
The previous prime is 50055503. The next prime is 50055527. The reversal of 50055505 is 50555005.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 50555005 = 5 ⋅10111001.
It can be written as a sum of positive squares in 2 ways, for example, as 12159169 + 37896336 = 3487^2 + 6156^2 .
It is not a de Polignac number, because 50055505 - 21 = 50055503 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 50055505.
It is not an unprimeable number, because it can be changed into a prime (50055503) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5005546 + ... + 5005555.
It is an arithmetic number, because the mean of its divisors is an integer number (15016653).
Almost surely, 250055505 is an apocalyptic number.
It is an amenable number.
50055505 is a deficient number, since it is larger than the sum of its proper divisors (10011107).
50055505 is a wasteful number, since it uses less digits than its factorization.
50055505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10011106.
The product of its (nonzero) digits is 3125, while the sum is 25.
The square root of 50055505 is about 7074.9915194295. The cubic root of 50055505 is about 368.5394208972.
Subtracting 50055505 from its reverse (50555005), we obtain a triangular number (499500 = T999).
The spelling of 50055505 in words is "fifty million, fifty-five thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •