Base | Representation |
---|---|
bin | 1111100111111… |
… | …01011001000101 |
3 | 100010121121022212 |
4 | 13303331121011 |
5 | 232022430232 |
6 | 21001033205 |
7 | 3151000652 |
oct | 763753105 |
9 | 303547285 |
10 | 131061317 |
11 | 67a87342 |
12 | 37a85805 |
13 | 211ca89a |
14 | 13598c29 |
15 | b78ceb2 |
hex | 7cfd645 |
131061317 has 4 divisors (see below), whose sum is σ = 131167500. Its totient is φ = 130955136.
The previous prime is 131061299. The next prime is 131061323. The reversal of 131061317 is 713160131.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 58232161 + 72829156 = 7631^2 + 8534^2 .
It is a cyclic number.
It is not a de Polignac number, because 131061317 - 26 = 131061253 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131061292 and 131061301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131069317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 51218 + ... + 53715.
It is an arithmetic number, because the mean of its divisors is an integer number (32791875).
Almost surely, 2131061317 is an apocalyptic number.
It is an amenable number.
131061317 is a deficient number, since it is larger than the sum of its proper divisors (106183).
131061317 is a wasteful number, since it uses less digits than its factorization.
131061317 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106182.
The product of its (nonzero) digits is 378, while the sum is 23.
The square root of 131061317 is about 11448.2014744675. The cubic root of 131061317 is about 507.9545356320.
The spelling of 131061317 in words is "one hundred thirty-one million, sixty-one thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •