Base | Representation |
---|---|
bin | 1100000011100… |
… | …1011111011011 |
3 | 10112011002001201 |
4 | 3000321133123 |
5 | 100421122011 |
6 | 5003455031 |
7 | 1152546016 |
oct | 300713733 |
9 | 115132051 |
10 | 50567131 |
11 | 265a891a |
12 | 14b27477 |
13 | a6265a4 |
14 | 6a0437d |
15 | 468ccc1 |
hex | 30397db |
50567131 has 2 divisors, whose sum is σ = 50567132. Its totient is φ = 50567130.
The previous prime is 50567119. The next prime is 50567137. The reversal of 50567131 is 13176505.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 50567131 - 213 = 50558939 is a prime.
It is a super-2 number, since 2×505671312 = 5114069475142322, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 50567131.
It is not a weakly prime, because it can be changed into another prime (50567137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25283565 + 25283566.
It is an arithmetic number, because the mean of its divisors is an integer number (25283566).
Almost surely, 250567131 is an apocalyptic number.
50567131 is a deficient number, since it is larger than the sum of its proper divisors (1).
50567131 is an equidigital number, since it uses as much as digits as its factorization.
50567131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3150, while the sum is 28.
The square root of 50567131 is about 7111.0569537868. The cubic root of 50567131 is about 369.7908021217.
The spelling of 50567131 in words is "fifty million, five hundred sixty-seven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •