Base | Representation |
---|---|
bin | 1100000011010… |
… | …1011100010111 |
3 | 10112010020022122 |
4 | 3000311130113 |
5 | 100420104201 |
6 | 5003250155 |
7 | 1152446462 |
oct | 300653427 |
9 | 115106278 |
10 | 50550551 |
11 | 26597417 |
12 | 14b1995b |
13 | a61bb8c |
14 | 69dc2d9 |
15 | 4687e1b |
hex | 3035717 |
50550551 has 4 divisors (see below), whose sum is σ = 51407400. Its totient is φ = 49693704.
The previous prime is 50550541. The next prime is 50550557. The reversal of 50550551 is 15505505.
50550551 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50550551 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 50550551.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50550557) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 428336 + ... + 428453.
It is an arithmetic number, because the mean of its divisors is an integer number (12851850).
Almost surely, 250550551 is an apocalyptic number.
50550551 is a deficient number, since it is larger than the sum of its proper divisors (856849).
50550551 is an equidigital number, since it uses as much as digits as its factorization.
50550551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 856848.
The product of its (nonzero) digits is 3125, while the sum is 26.
The square root of 50550551 is about 7109.8910680825. The cubic root of 50550551 is about 369.7503819147.
The spelling of 50550551 in words is "fifty million, five hundred fifty thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •