Base | Representation |
---|---|
bin | 11101110101011… |
… | …100100110101001 |
3 | 1021212212120121000 |
4 | 131311130212221 |
5 | 2011120100212 |
6 | 121400305213 |
7 | 15255414420 |
oct | 3565344651 |
9 | 1255776530 |
10 | 500550057 |
11 | 237602737 |
12 | 11b772209 |
13 | 7c918587 |
14 | 4a69a2b7 |
15 | 2de261dc |
hex | 1dd5c9a9 |
500550057 has 64 divisors (see below), whose sum is σ = 918466560. Its totient is φ = 262870272.
The previous prime is 500550013. The next prime is 500550059. The reversal of 500550057 is 750055005.
It is not a de Polignac number, because 500550057 - 26 = 500549993 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 500550057.
It is not an unprimeable number, because it can be changed into a prime (500550059) 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 63 ways as a sum of consecutive naturals, for example, 136348 + ... + 139970.
It is an arithmetic number, because the mean of its divisors is an integer number (14351040).
Almost surely, 2500550057 is an apocalyptic number.
It is an amenable number.
500550057 is a deficient number, since it is larger than the sum of its proper divisors (417916503).
500550057 is a wasteful number, since it uses less digits than its factorization.
500550057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3699 (or 3693 counting only the distinct ones).
The product of its (nonzero) digits is 4375, while the sum is 27.
The square root of 500550057 is about 22372.9760425385. The cubic root of 500550057 is about 793.9914730054.
The spelling of 500550057 in words is "five hundred million, five hundred fifty thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •