Base | Representation |
---|---|
bin | 1011111101000… |
… | …1011001101101 |
3 | 10111100102012222 |
4 | 2333101121231 |
5 | 100314001111 |
6 | 4550405125 |
7 | 1146122015 |
oct | 277213155 |
9 | 114312188 |
10 | 50140781 |
11 | 26337569 |
12 | 149607a5 |
13 | a507502 |
14 | 6932c45 |
15 | 46067db |
hex | 2fd166d |
50140781 has 2 divisors, whose sum is σ = 50140782. Its totient is φ = 50140780.
The previous prime is 50140771. The next prime is 50140789. The reversal of 50140781 is 18704105.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29800681 + 20340100 = 5459^2 + 4510^2 .
It is a cyclic number.
It is not a de Polignac number, because 50140781 - 222 = 45946477 is a prime.
It is a super-2 number, since 2×501407812 = 5028195838579922, which contains 22 as substring.
It is equal to p3009068 and since 50140781 and 3009068 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 50140781.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50140789) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25070390 + 25070391.
It is an arithmetic number, because the mean of its divisors is an integer number (25070391).
Almost surely, 250140781 is an apocalyptic number.
It is an amenable number.
50140781 is a deficient number, since it is larger than the sum of its proper divisors (1).
50140781 is an equidigital number, since it uses as much as digits as its factorization.
50140781 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1120, while the sum is 26.
The square root of 50140781 is about 7081.0155345120. The cubic root of 50140781 is about 368.7485869524.
Adding to 50140781 its reverse (18704105), we get a palindrome (68844886).
The spelling of 50140781 in words is "fifty million, one hundred forty thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •