Base | Representation |
---|---|
bin | 111101001111001100… |
… | …0000001010000111001 |
3 | 110120102212221211212121 |
4 | 1322132120001100321 |
5 | 4123311031200031 |
6 | 140225120241241 |
7 | 12333562353025 |
oct | 1723630012071 |
9 | 416385854777 |
10 | 131506115641 |
11 | 508538570aa |
12 | 215a1170221 |
13 | c529c28614 |
14 | 6517521385 |
15 | 364a1ba011 |
hex | 1e9e601439 |
131506115641 has 4 divisors (see below), whose sum is σ = 131507682192. Its totient is φ = 131504549092.
The previous prime is 131506115639. The next prime is 131506115677. The reversal of 131506115641 is 146511605131.
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 131506115641 - 21 = 131506115639 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131506115597 and 131506115606.
It is not an unprimeable number, because it can be changed into a prime (131506115141) 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, 649771 + ... + 827776.
It is an arithmetic number, because the mean of its divisors is an integer number (32876920548).
Almost surely, 2131506115641 is an apocalyptic number.
It is an amenable number.
131506115641 is a deficient number, since it is larger than the sum of its proper divisors (1566551).
131506115641 is an equidigital number, since it uses as much as digits as its factorization.
131506115641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1566550.
The product of its (nonzero) digits is 10800, while the sum is 34.
The spelling of 131506115641 in words is "one hundred thirty-one billion, five hundred six million, one hundred fifteen thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •