Base | Representation |
---|---|
bin | 1111101001110… |
… | …10100111100101 |
3 | 100011002100100011 |
4 | 13310322213211 |
5 | 232103441401 |
6 | 21010250221 |
7 | 3153064054 |
oct | 764724745 |
9 | 304070304 |
10 | 131312101 |
11 | 681387a8 |
12 | 37b86971 |
13 | 21287a8b |
14 | 1362239b |
15 | b7dc451 |
hex | 7d3a9e5 |
131312101 has 4 divisors (see below), whose sum is σ = 132665932. Its totient is φ = 129958272.
The previous prime is 131312047. The next prime is 131312147. The reversal of 131312101 is 101213131.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 99400900 + 31911201 = 9970^2 + 5649^2 .
It is not a de Polignac number, because 131312101 - 221 = 129214949 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131312201) 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 3 ways as a sum of consecutive naturals, for example, 676770 + ... + 676963.
It is an arithmetic number, because the mean of its divisors is an integer number (33166483).
Almost surely, 2131312101 is an apocalyptic number.
It is an amenable number.
131312101 is a deficient number, since it is larger than the sum of its proper divisors (1353831).
131312101 is an equidigital number, since it uses as much as digits as its factorization.
131312101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1353830.
The product of its (nonzero) digits is 18, while the sum is 13.
The square root of 131312101 is about 11459.1492267096. The cubic root of 131312101 is about 508.2783171729.
Adding to 131312101 its reverse (101213131), we get a palindrome (232525232).
The spelling of 131312101 in words is "one hundred thirty-one million, three hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •