Base | Representation |
---|---|
bin | 1111101001100… |
… | …01110111000111 |
3 | 100011000112010122 |
4 | 13310301313013 |
5 | 232101314411 |
6 | 21005412155 |
7 | 3152554352 |
oct | 764616707 |
9 | 304015118 |
10 | 131276231 |
11 | 68113859 |
12 | 37b6a05b |
13 | 21274658 |
14 | 13613299 |
15 | b7d19db |
hex | 7d31dc7 |
131276231 has 8 divisors (see below), whose sum is σ = 133509024. Its totient is φ = 129054240.
The previous prime is 131276213. The next prime is 131276237. The reversal of 131276231 is 132672131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131276231 is a prime.
It is a super-2 number, since 2×1312762312 = 34466897651130722, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 131276231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131276237) 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 7 ways as a sum of consecutive naturals, for example, 24005 + ... + 28961.
It is an arithmetic number, because the mean of its divisors is an integer number (16688628).
Almost surely, 2131276231 is an apocalyptic number.
131276231 is a deficient number, since it is larger than the sum of its proper divisors (2232793).
131276231 is an equidigital number, since it uses as much as digits as its factorization.
131276231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5401.
The product of its digits is 1512, while the sum is 26.
The square root of 131276231 is about 11457.5839948918. The cubic root of 131276231 is about 508.2320315083.
The spelling of 131276231 in words is "one hundred thirty-one million, two hundred seventy-six thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •