Base | Representation |
---|---|
bin | 1111101001101… |
… | …10011100011000 |
3 | 100011001110212210 |
4 | 13310312130120 |
5 | 232102420000 |
6 | 21010035120 |
7 | 3152663154 |
oct | 764663430 |
9 | 304043783 |
10 | 131295000 |
11 | 68126971 |
12 | 37b78aa0 |
13 | 21280065 |
14 | 1361a064 |
15 | b7d7350 |
hex | 7d36718 |
131295000 has 80 divisors (see below), whose sum is σ = 410212440. Its totient is φ = 35008000.
The previous prime is 131294993. The next prime is 131295007. The reversal of 131295000 is 592131.
It is an interprime number because it is at equal distance from previous prime (131294993) and next prime (131295007).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131295007) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 10624 + ... + 19376.
Almost surely, 2131295000 is an apocalyptic number.
131295000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 131295000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (205106220).
131295000 is an abundant number, since it is smaller than the sum of its proper divisors (278917440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131295000 is an equidigital number, since it uses as much as digits as its factorization.
131295000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8782 (or 8763 counting only the distinct ones).
The product of its (nonzero) digits is 270, while the sum is 21.
The square root of 131295000 is about 11458.4030300911. The cubic root of 131295000 is about 508.2562515628.
The spelling of 131295000 in words is "one hundred thirty-one million, two hundred ninety-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •