Base | Representation |
---|---|
bin | 1100000110001… |
… | …1011110111011 |
3 | 10112110211000002 |
4 | 3001203132323 |
5 | 100442123011 |
6 | 5011303215 |
7 | 1154163332 |
oct | 301433673 |
9 | 115424002 |
10 | 50739131 |
11 | 26706073 |
12 | 14baab0b |
13 | a686971 |
14 | 6a4ad19 |
15 | 46c3c3b |
hex | 30637bb |
50739131 has 2 divisors, whose sum is σ = 50739132. Its totient is φ = 50739130.
The previous prime is 50739113. The next prime is 50739133. The reversal of 50739131 is 13193705.
Together with previous prime (50739113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50739131 is a prime.
It is a super-2 number, since 2×507391312 = 5148918829270322, which contains 22 as substring.
Together with 50739133, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 50739094 and 50739103.
It is not a weakly prime, because it can be changed into another prime (50739133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25369565 + 25369566.
It is an arithmetic number, because the mean of its divisors is an integer number (25369566).
Almost surely, 250739131 is an apocalyptic number.
50739131 is a deficient number, since it is larger than the sum of its proper divisors (1).
50739131 is an equidigital number, since it uses as much as digits as its factorization.
50739131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2835, while the sum is 29.
The square root of 50739131 is about 7123.1405292890. The cubic root of 50739131 is about 370.2095987988.
The spelling of 50739131 in words is "fifty million, seven hundred thirty-nine thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •