Base | Representation |
---|---|
bin | 11101110011110… |
… | …000100110100001 |
3 | 1021212001002202201 |
4 | 131303300212201 |
5 | 2011011421211 |
6 | 121343013201 |
7 | 15251562613 |
oct | 3563604641 |
9 | 1255032681 |
10 | 500107681 |
11 | 237330337 |
12 | 11b59a201 |
13 | 7c7c2108 |
14 | 4a5c2db3 |
15 | 2dd8a0c1 |
hex | 1dcf09a1 |
500107681 has 2 divisors, whose sum is σ = 500107682. Its totient is φ = 500107680.
The previous prime is 500107669. The next prime is 500107687. The reversal of 500107681 is 186701005.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 375584400 + 124523281 = 19380^2 + 11159^2 .
It is a cyclic number.
It is not a de Polignac number, because 500107681 - 29 = 500107169 is a prime.
It is a super-2 number, since 2×5001076812 = 500215385190395522, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (500107687) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 250053840 + 250053841.
It is an arithmetic number, because the mean of its divisors is an integer number (250053841).
Almost surely, 2500107681 is an apocalyptic number.
It is an amenable number.
500107681 is a deficient number, since it is larger than the sum of its proper divisors (1).
500107681 is an equidigital number, since it uses as much as digits as its factorization.
500107681 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1680, while the sum is 28.
The square root of 500107681 is about 22363.0874657325. The cubic root of 500107681 is about 793.7574995385.
Adding to 500107681 its reverse (186701005), we get a palindrome (686808686).
The spelling of 500107681 in words is "five hundred million, one hundred seven thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •