Base | Representation |
---|---|
bin | 1111101000111… |
… | …00001001000101 |
3 | 100010212000002202 |
4 | 13310130021011 |
5 | 232040443034 |
6 | 21003444245 |
7 | 3152034113 |
oct | 764341105 |
9 | 303760082 |
10 | 131187269 |
11 | 68062a34 |
12 | 37b26685 |
13 | 21243005 |
14 | 135ccab3 |
15 | b7b547e |
hex | 7d1c245 |
131187269 has 4 divisors (see below), whose sum is σ = 131316780. Its totient is φ = 131057760.
The previous prime is 131187263. The next prime is 131187307. The reversal of 131187269 is 962781131.
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 36844900 + 94342369 = 6070^2 + 9713^2 .
It is a cyclic number.
It is not a de Polignac number, because 131187269 - 24 = 131187253 is a prime.
It is a super-2 number, since 2×1311872692 = 34420199095356722, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131187263) 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 in 3 ways as a sum of consecutive naturals, for example, 63224 + ... + 65265.
It is an arithmetic number, because the mean of its divisors is an integer number (32829195).
Almost surely, 2131187269 is an apocalyptic number.
It is an amenable number.
131187269 is a deficient number, since it is larger than the sum of its proper divisors (129511).
131187269 is a wasteful number, since it uses less digits than its factorization.
131187269 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129510.
The product of its digits is 18144, while the sum is 38.
The square root of 131187269 is about 11453.7011048831. The cubic root of 131187269 is about 508.1172009845.
The spelling of 131187269 in words is "one hundred thirty-one million, one hundred eighty-seven thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •