Base | Representation |
---|---|
bin | 1100000101110… |
… | …1000111000111 |
3 | 10112102111012102 |
4 | 3001131013013 |
5 | 100440304111 |
6 | 5010542315 |
7 | 1154024255 |
oct | 301350707 |
9 | 115374172 |
10 | 50713031 |
11 | 266984a6 |
12 | 14b9799b |
13 | a677b15 |
14 | 6a415d5 |
15 | 46bb13b |
hex | 305d1c7 |
50713031 has 2 divisors, whose sum is σ = 50713032. Its totient is φ = 50713030.
The previous prime is 50712979. The next prime is 50713067. The reversal of 50713031 is 13031705.
It is a happy number.
50713031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50713031 is a prime.
It is a super-2 number, since 2×507130312 = 5143623026413922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 50712994 and 50713012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50713931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25356515 + 25356516.
It is an arithmetic number, because the mean of its divisors is an integer number (25356516).
Almost surely, 250713031 is an apocalyptic number.
50713031 is a deficient number, since it is larger than the sum of its proper divisors (1).
50713031 is an equidigital number, since it uses as much as digits as its factorization.
50713031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 315, while the sum is 20.
The square root of 50713031 is about 7121.3082365532. The cubic root of 50713031 is about 370.1461098138.
Adding to 50713031 its reverse (13031705), we get a palindrome (63744736).
The spelling of 50713031 in words is "fifty million, seven hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •