Base | Representation |
---|---|
bin | 1111100111110… |
… | …01011100010101 |
3 | 100010120210010202 |
4 | 13303321130111 |
5 | 232021421031 |
6 | 21000430245 |
7 | 3150602543 |
oct | 763713425 |
9 | 303523122 |
10 | 131045141 |
11 | 67a76177 |
12 | 37a78385 |
13 | 211c3406 |
14 | 13592d93 |
15 | b7882cb |
hex | 7cf9715 |
131045141 has 8 divisors (see below), whose sum is σ = 134422200. Its totient is φ = 127707840.
The previous prime is 131045111. The next prime is 131045219. The reversal of 131045141 is 141540131.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 5044516 + 126000625 = 2246^2 + 11225^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131045141 - 226 = 63936277 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 (131045111) 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 7 ways as a sum of consecutive naturals, for example, 3206 + ... + 16503.
It is an arithmetic number, because the mean of its divisors is an integer number (16802775).
Almost surely, 2131045141 is an apocalyptic number.
It is an amenable number.
131045141 is a deficient number, since it is larger than the sum of its proper divisors (3377059).
131045141 is a wasteful number, since it uses less digits than its factorization.
131045141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19879.
The product of its (nonzero) digits is 240, while the sum is 20.
The square root of 131045141 is about 11447.4949661487. The cubic root of 131045141 is about 507.9336369899.
Adding to 131045141 its reverse (141540131), we get a palindrome (272585272).
The spelling of 131045141 in words is "one hundred thirty-one million, forty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •