Base | Representation |
---|---|
bin | 1100000100001… |
… | …1010101100101 |
3 | 10112020010101102 |
4 | 3001003111211 |
5 | 100423414321 |
6 | 5004405445 |
7 | 1153104422 |
oct | 301032545 |
9 | 115203342 |
10 | 50607461 |
11 | 26626153 |
12 | 14b46885 |
13 | a63ba58 |
14 | 6a14d49 |
15 | 4699c0b |
hex | 3043565 |
50607461 has 2 divisors, whose sum is σ = 50607462. Its totient is φ = 50607460.
The previous prime is 50607457. The next prime is 50607463. The reversal of 50607461 is 16470605.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 50495236 + 112225 = 7106^2 + 335^2 .
It is a cyclic number.
It is not a de Polignac number, because 50607461 - 22 = 50607457 is a prime.
It is a super-2 number, since 2×506074612 = 5122230217733042, which contains 22 as substring.
Together with 50607463, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50607463) 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 as a sum of consecutive naturals, namely, 25303730 + 25303731.
It is an arithmetic number, because the mean of its divisors is an integer number (25303731).
Almost surely, 250607461 is an apocalyptic number.
It is an amenable number.
50607461 is a deficient number, since it is larger than the sum of its proper divisors (1).
50607461 is an equidigital number, since it uses as much as digits as its factorization.
50607461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5040, while the sum is 29.
The square root of 50607461 is about 7113.8921133231. The cubic root of 50607461 is about 369.8890853325.
It can be divided in two parts, 5060 and 7461, that added together give a palindrome (12521).
The spelling of 50607461 in words is "fifty million, six hundred seven thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •