Base | Representation |
---|---|
bin | 111101001010010001… |
… | …1011101011101001101 |
3 | 110120000101220111200012 |
4 | 1322110203131131031 |
5 | 4122441340430131 |
6 | 140200512443005 |
7 | 12326521664003 |
oct | 1722443353515 |
9 | 416011814605 |
10 | 131341342541 |
11 | 50779844692 |
12 | 21555b49465 |
13 | c501a56446 |
14 | 64dd6aca73 |
15 | 363a9bd52b |
hex | 1e948dd74d |
131341342541 has 4 divisors (see below), whose sum is σ = 138254044800. Its totient is φ = 124428640284.
The previous prime is 131341342513. The next prime is 131341342589. The reversal of 131341342541 is 145243143131.
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 131341342541 - 230 = 130267600717 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131341342498 and 131341342507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131341342501) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3456351101 + ... + 3456351138.
It is an arithmetic number, because the mean of its divisors is an integer number (34563511200).
Almost surely, 2131341342541 is an apocalyptic number.
It is an amenable number.
131341342541 is a deficient number, since it is larger than the sum of its proper divisors (6912702259).
131341342541 is an equidigital number, since it uses as much as digits as its factorization.
131341342541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6912702258.
The product of its digits is 17280, while the sum is 32.
Adding to 131341342541 its reverse (145243143131), we get a palindrome (276584485672).
The spelling of 131341342541 in words is "one hundred thirty-one billion, three hundred forty-one million, three hundred forty-two thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •