Base | Representation |
---|---|
bin | 1111101000100… |
… | …00100111001001 |
3 | 100010202121022120 |
4 | 13310100213021 |
5 | 232032440131 |
6 | 21002441453 |
7 | 3151446324 |
oct | 764204711 |
9 | 303677276 |
10 | 131140041 |
11 | 680304aa |
12 | 37b03289 |
13 | 21227676 |
14 | 135b97bb |
15 | b7a6496 |
hex | 7d109c9 |
131140041 has 4 divisors (see below), whose sum is σ = 174853392. Its totient is φ = 87426692.
The previous prime is 131140007. The next prime is 131140049. The reversal of 131140041 is 140041131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 131140041 - 27 = 131139913 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 131140041.
It is not an unprimeable number, because it can be changed into a prime (131140049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21856671 + ... + 21856676.
It is an arithmetic number, because the mean of its divisors is an integer number (43713348).
Almost surely, 2131140041 is an apocalyptic number.
It is an amenable number.
131140041 is a deficient number, since it is larger than the sum of its proper divisors (43713351).
131140041 is an equidigital number, since it uses as much as digits as its factorization.
131140041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43713350.
The product of its (nonzero) digits is 48, while the sum is 15.
The square root of 131140041 is about 11451.6392276390. The cubic root of 131140041 is about 508.0562188490.
Adding to 131140041 its reverse (140041131), we get a palindrome (271181172).
The spelling of 131140041 in words is "one hundred thirty-one million, one hundred forty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •