Base | Representation |
---|---|
bin | 1111101010111… |
… | …10000111011100 |
3 | 100011100201210022 |
4 | 13311132013130 |
5 | 232123120000 |
6 | 21013331312 |
7 | 3154241006 |
oct | 765360734 |
9 | 304321708 |
10 | 131457500 |
11 | 68227a69 |
12 | 38036b38 |
13 | 21309005 |
14 | 1365d376 |
15 | b81a585 |
hex | 7d5e1dc |
131457500 has 30 divisors (see below), whose sum is σ = 287476728. Its totient is φ = 52582000.
The previous prime is 131457497. The next prime is 131457503. The reversal of 131457500 is 5754131.
It is an interprime number because it is at equal distance from previous prime (131457497) and next prime (131457503).
It is a self number, because there is not a number n which added to its sum of digits gives 131457500.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131457503) 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 9 ways as a sum of consecutive naturals, for example, 23792 + ... + 28791.
Almost surely, 2131457500 is an apocalyptic number.
131457500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131457500 is an abundant number, since it is smaller than the sum of its proper divisors (156019228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131457500 is an equidigital number, since it uses as much as digits as its factorization.
131457500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52607 (or 52590 counting only the distinct ones).
The product of its (nonzero) digits is 2100, while the sum is 26.
The square root of 131457500 is about 11465.4917033680. The cubic root of 131457500 is about 508.4658497718.
The spelling of 131457500 in words is "one hundred thirty-one million, four hundred fifty-seven thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •