Base | Representation |
---|---|
bin | 1111101110110… |
… | …11000101110101 |
3 | 100012022201222110 |
4 | 13313123011311 |
5 | 232241010042 |
6 | 21032321233 |
7 | 3161502300 |
oct | 767330565 |
9 | 305281873 |
10 | 131969397 |
11 | 6854761a |
12 | 38243219 |
13 | 21458001 |
14 | 13753b37 |
15 | b8bc09c |
hex | 7ddb175 |
131969397 has 12 divisors (see below), whose sum is σ = 204687456. Its totient is φ = 75411000.
The previous prime is 131969389. The next prime is 131969399. The reversal of 131969397 is 793969131.
It is not a de Polignac number, because 131969397 - 23 = 131969389 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131969399) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 448729 + ... + 449022.
It is an arithmetic number, because the mean of its divisors is an integer number (17057288).
Almost surely, 2131969397 is an apocalyptic number.
It is an amenable number.
131969397 is a deficient number, since it is larger than the sum of its proper divisors (72718059).
131969397 is an equidigital number, since it uses as much as digits as its factorization.
131969397 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 897768 (or 897761 counting only the distinct ones).
The product of its digits is 275562, while the sum is 48.
The square root of 131969397 is about 11487.7933912479. The cubic root of 131969397 is about 509.1249855504.
It can be divided in two parts, 131 and 969397, that added together give a triangular number (969528 = T1392).
The spelling of 131969397 in words is "one hundred thirty-one million, nine hundred sixty-nine thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •