Base | Representation |
---|---|
bin | 1100000011011… |
… | …0100011101000 |
3 | 10112010110120120 |
4 | 3000312203220 |
5 | 100420230422 |
6 | 5003323240 |
7 | 1152465666 |
oct | 300664350 |
9 | 115113516 |
10 | 50555112 |
11 | 2659a893 |
12 | 14b20520 |
13 | a620c8a |
14 | 69ddc36 |
15 | 468945c |
hex | 30368e8 |
50555112 has 16 divisors (see below), whose sum is σ = 126387840. Its totient is φ = 16851696.
The previous prime is 50555107. The next prime is 50555117. The reversal of 50555112 is 21155505.
It is an interprime number because it is at equal distance from previous prime (50555107) and next prime (50555117).
It is a Harshad number since it is a multiple of its sum of digits (24), and also a Moran number because the ratio is a prime number: 2106463 = 50555112 / (5 + 0 + 5 + 5 + 5 + 1 + 1 + 2).
It is not an unprimeable number, because it can be changed into a prime (50555117) 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 3 ways as a sum of consecutive naturals, for example, 1053208 + ... + 1053255.
It is an arithmetic number, because the mean of its divisors is an integer number (7899240).
Almost surely, 250555112 is an apocalyptic number.
It is an amenable number.
50555112 is an abundant number, since it is smaller than the sum of its proper divisors (75832728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50555112 is a wasteful number, since it uses less digits than its factorization.
50555112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2106472 (or 2106468 counting only the distinct ones).
The product of its (nonzero) digits is 1250, while the sum is 24.
The square root of 50555112 is about 7110.2118111910. The cubic root of 50555112 is about 369.7615020096.
The spelling of 50555112 in words is "fifty million, five hundred fifty-five thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •