Base | Representation |
---|---|
bin | 1111101000011… |
… | …01000000000011 |
3 | 100010201212000210 |
4 | 13310031000003 |
5 | 232032002001 |
6 | 21002245203 |
7 | 3151355235 |
oct | 764150003 |
9 | 303655023 |
10 | 131125251 |
11 | 68020384 |
12 | 37ab6803 |
13 | 21220a0a |
14 | 135b4255 |
15 | b7a1dd6 |
hex | 7d0d003 |
131125251 has 8 divisors (see below), whose sum is σ = 184035520. Its totient is φ = 82815912.
The previous prime is 131125243. The next prime is 131125259. The reversal of 131125251 is 152521131.
It is an interprime number because it is at equal distance from previous prime (131125243) and next prime (131125259).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 131125251 - 23 = 131125243 is a prime.
It is not an unprimeable number, because it can be changed into a prime (131125259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1150165 + ... + 1150278.
It is an arithmetic number, because the mean of its divisors is an integer number (23004440).
Almost surely, 2131125251 is an apocalyptic number.
131125251 is a deficient number, since it is larger than the sum of its proper divisors (52910269).
131125251 is a wasteful number, since it uses less digits than its factorization.
131125251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2300465.
The product of its digits is 300, while the sum is 21.
The square root of 131125251 is about 11450.9934503518. The cubic root of 131125251 is about 508.0371185703.
Adding to 131125251 its reverse (152521131), we get a palindrome (283646382).
It can be divided in two parts, 1311 and 25251, that added together give a palindrome (26562).
The spelling of 131125251 in words is "one hundred thirty-one million, one hundred twenty-five thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •