Base | Representation |
---|---|
bin | 1111101011110… |
… | …10000110011101 |
3 | 100011120120000200 |
4 | 13311322012131 |
5 | 232140302000 |
6 | 21020014113 |
7 | 3155226126 |
oct | 765720635 |
9 | 304516020 |
10 | 131572125 |
11 | 682a60a3 |
12 | 38091339 |
13 | 21349239 |
14 | 1368d04d |
15 | b83e500 |
hex | 7d7a19d |
131572125 has 24 divisors (see below), whose sum is σ = 237182712. Its totient is φ = 70171200.
The previous prime is 131572109. The next prime is 131572193. The reversal of 131572125 is 521275131.
It can be written as a sum of positive squares in 4 ways, for example, as 21511044 + 110061081 = 4638^2 + 10491^2 .
It is not a de Polignac number, because 131572125 - 24 = 131572109 is a prime.
It is a super-2 number, since 2×1315721252 = 34622448154031250, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 57352 + ... + 59601.
It is an arithmetic number, because the mean of its divisors is an integer number (9882613).
Almost surely, 2131572125 is an apocalyptic number.
131572125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
131572125 is a deficient number, since it is larger than the sum of its proper divisors (105610587).
131572125 is a wasteful number, since it uses less digits than its factorization.
131572125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116974 (or 116961 counting only the distinct ones).
The product of its digits is 2100, while the sum is 27.
The square root of 131572125 is about 11470.4893095282. The cubic root of 131572125 is about 508.6135932534.
The spelling of 131572125 in words is "one hundred thirty-one million, five hundred seventy-two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •