Base | Representation |
---|---|
bin | 1111101011010… |
… | …01011011011101 |
3 | 100011110002100111 |
4 | 13311221123131 |
5 | 232131110322 |
6 | 21014330021 |
7 | 3154523053 |
oct | 765513335 |
9 | 304402314 |
10 | 131503837 |
11 | 68259863 |
12 | 38059911 |
13 | 2132412a |
14 | 136721d3 |
15 | b829177 |
hex | 7d696dd |
131503837 has 2 divisors, whose sum is σ = 131503838. Its totient is φ = 131503836.
The previous prime is 131503783. The next prime is 131503859. The reversal of 131503837 is 738305131.
It is a happy number.
Together with previous prime (131503783) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 81108036 + 50395801 = 9006^2 + 7099^2 .
It is a cyclic number.
It is not a de Polignac number, because 131503837 - 211 = 131501789 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 131503799 and 131503808.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131503877) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65751918 + 65751919.
It is an arithmetic number, because the mean of its divisors is an integer number (65751919).
Almost surely, 2131503837 is an apocalyptic number.
It is an amenable number.
131503837 is a deficient number, since it is larger than the sum of its proper divisors (1).
131503837 is an equidigital number, since it uses as much as digits as its factorization.
131503837 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7560, while the sum is 31.
The square root of 131503837 is about 11467.5122411097. The cubic root of 131503837 is about 508.5255852106.
Adding to 131503837 its reverse (738305131), we get a palindrome (869808968).
The spelling of 131503837 in words is "one hundred thirty-one million, five hundred three thousand, eight hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •