Base | Representation |
---|---|
bin | 1111101010001… |
… | …11011101110111 |
3 | 100011012000112021 |
4 | 13311013131313 |
5 | 232112132402 |
6 | 21011334011 |
7 | 3153403354 |
oct | 765073567 |
9 | 304160467 |
10 | 131364727 |
11 | 6817429a |
12 | 37bb1307 |
13 | 212a5a10 |
14 | 1363762b |
15 | b7ecd37 |
hex | 7d47777 |
131364727 has 8 divisors (see below), whose sum is σ = 148915760. Its totient is φ = 114877440.
The previous prime is 131364721. The next prime is 131364733. The reversal of 131364727 is 727463131.
It is an interprime number because it is at equal distance from previous prime (131364721) and next prime (131364733).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131364727 - 23 = 131364719 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131364692 and 131364701.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131364721) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 265674 + ... + 266167.
It is an arithmetic number, because the mean of its divisors is an integer number (18614470).
Almost surely, 2131364727 is an apocalyptic number.
131364727 is a deficient number, since it is larger than the sum of its proper divisors (17551033).
131364727 is a wasteful number, since it uses less digits than its factorization.
131364727 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 531873.
The product of its digits is 21168, while the sum is 34.
The square root of 131364727 is about 11461.4452404572. The cubic root of 131364727 is about 508.3462090680.
The spelling of 131364727 in words is "one hundred thirty-one million, three hundred sixty-four thousand, seven hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •