Base | Representation |
---|---|
bin | 1111101011001… |
… | …11111011011111 |
3 | 100011102202221000 |
4 | 13311213323133 |
5 | 232130411240 |
6 | 21014241343 |
7 | 3154466130 |
oct | 765477337 |
9 | 304382830 |
10 | 131497695 |
11 | 6825518a |
12 | 38056253 |
13 | 213213b4 |
14 | 1366dc87 |
15 | b827430 |
hex | 7d67edf |
131497695 has 64 divisors (see below), whose sum is σ = 268784640. Its totient is φ = 59750784.
The previous prime is 131497679. The next prime is 131497699. The reversal of 131497695 is 596794131.
It is not a de Polignac number, because 131497695 - 24 = 131497679 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 131497695.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131497699) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 214209 + ... + 214821.
It is an arithmetic number, because the mean of its divisors is an integer number (4199760).
Almost surely, 2131497695 is an apocalyptic number.
131497695 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
131497695 is an abundant number, since it is smaller than the sum of its proper divisors (137286945).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131497695 is a wasteful number, since it uses less digits than its factorization.
131497695 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 861 (or 855 counting only the distinct ones).
The product of its digits is 204120, while the sum is 45.
The square root of 131497695 is about 11467.2444379633. The cubic root of 131497695 is about 508.5176680454.
The spelling of 131497695 in words is "one hundred thirty-one million, four hundred ninety-seven thousand, six hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •