Base | Representation |
---|---|
bin | 1111101011100… |
… | …10101100101101 |
3 | 100011112000102201 |
4 | 13311302230231 |
5 | 232133314210 |
6 | 21015221501 |
7 | 3155041543 |
oct | 765625455 |
9 | 304460381 |
10 | 131541805 |
11 | 6828533a |
12 | 38077891 |
13 | 213384b5 |
14 | 13681d93 |
15 | b83553a |
hex | 7d72b2d |
131541805 has 4 divisors (see below), whose sum is σ = 157850172. Its totient is φ = 105233440.
The previous prime is 131541779. The next prime is 131541811. The reversal of 131541805 is 508145131.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 508145131 = 13 ⋅39088087.
It can be written as a sum of positive squares in 2 ways, for example, as 48038761 + 83503044 = 6931^2 + 9138^2 .
It is not a de Polignac number, because 131541805 - 223 = 123153197 is a prime.
It is a Duffinian number.
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, 13154176 + ... + 13154185.
It is an arithmetic number, because the mean of its divisors is an integer number (39462543).
Almost surely, 2131541805 is an apocalyptic number.
It is an amenable number.
131541805 is a deficient number, since it is larger than the sum of its proper divisors (26308367).
131541805 is an equidigital number, since it uses as much as digits as its factorization.
131541805 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26308366.
The product of its (nonzero) digits is 2400, while the sum is 28.
The square root of 131541805 is about 11469.1675809537. The cubic root of 131541805 is about 508.5745212771.
Adding to 131541805 its reverse (508145131), we get a palindrome (639686936).
The spelling of 131541805 in words is "one hundred thirty-one million, five hundred forty-one thousand, eight hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •