Base | Representation |
---|---|
bin | 1100000100001… |
… | …0110111111111 |
3 | 10112020000210021 |
4 | 3001002313333 |
5 | 100423334232 |
6 | 5004353011 |
7 | 1153066045 |
oct | 301026777 |
9 | 115200707 |
10 | 50605567 |
11 | 26624791 |
12 | 14b45767 |
13 | a63ac2c |
14 | 6a14395 |
15 | 4699397 |
hex | 3042dff |
50605567 has 2 divisors, whose sum is σ = 50605568. Its totient is φ = 50605566.
The previous prime is 50605553. The next prime is 50605601. The reversal of 50605567 is 76550605.
It is an a-pointer prime, because the next prime (50605601) can be obtained adding 50605567 to its sum of digits (34).
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50605567 is a prime.
It is a super-2 number, since 2×506055672 = 5121846822782978, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50605517) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25302783 + 25302784.
It is an arithmetic number, because the mean of its divisors is an integer number (25302784).
Almost surely, 250605567 is an apocalyptic number.
50605567 is a deficient number, since it is larger than the sum of its proper divisors (1).
50605567 is an equidigital number, since it uses as much as digits as its factorization.
50605567 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31500, while the sum is 34.
The square root of 50605567 is about 7113.7589922628. The cubic root of 50605567 is about 369.8844708702.
The spelling of 50605567 in words is "fifty million, six hundred five thousand, five hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •