Base | Representation |
---|---|
bin | 1111100111011… |
… | …10100100100111 |
3 | 100010111112001122 |
4 | 13303232210213 |
5 | 232014004430 |
6 | 20555444155 |
7 | 3150325664 |
oct | 763564447 |
9 | 303445048 |
10 | 131000615 |
11 | 67a45779 |
12 | 37a5665b |
13 | 211a9075 |
14 | 13580a6b |
15 | b779ee5 |
hex | 7cee927 |
131000615 has 4 divisors (see below), whose sum is σ = 157200744. Its totient is φ = 104800488.
The previous prime is 131000581. The next prime is 131000641. The reversal of 131000615 is 516000131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 131000615 - 218 = 130738471 is a prime.
It is a super-2 number, since 2×1310006152 = 34322322260756450, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131000593 and 131000602.
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 3 ways as a sum of consecutive naturals, for example, 13100057 + ... + 13100066.
It is an arithmetic number, because the mean of its divisors is an integer number (39300186).
Almost surely, 2131000615 is an apocalyptic number.
131000615 is a deficient number, since it is larger than the sum of its proper divisors (26200129).
131000615 is an equidigital number, since it uses as much as digits as its factorization.
131000615 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26200128.
The product of its (nonzero) digits is 90, while the sum is 17.
The square root of 131000615 is about 11445.5500086278. The cubic root of 131000615 is about 507.8761025787.
Adding to 131000615 its reverse (516000131), we get a palindrome (647000746).
The spelling of 131000615 in words is "one hundred thirty-one million, six hundred fifteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •