Base | Representation |
---|---|
bin | 111101000100000011… |
… | …0001001010100101111 |
3 | 110112110211121122011112 |
4 | 1322020012021110233 |
5 | 4122024334100221 |
6 | 140124044542235 |
7 | 12321403265552 |
oct | 1721006112457 |
9 | 415424548145 |
10 | 131132331311 |
11 | 50681867433 |
12 | 214b7b5197b |
13 | c49a665667 |
14 | 64bda22699 |
15 | 362748415b |
hex | 1e8818952f |
131132331311 has 4 divisors (see below), whose sum is σ = 131508069000. Its totient is φ = 130756593624.
The previous prime is 131132331301. The next prime is 131132331359. The reversal of 131132331311 is 113133231131.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 113133231131 = 983 ⋅115089757.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131132331311 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 (131132331301) 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, 187868321 + ... + 187869018.
It is an arithmetic number, because the mean of its divisors is an integer number (32877017250).
Almost surely, 2131132331311 is an apocalyptic number.
131132331311 is a deficient number, since it is larger than the sum of its proper divisors (375737689).
131132331311 is an equidigital number, since it uses as much as digits as its factorization.
131132331311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 375737688.
The product of its digits is 486, while the sum is 23.
Adding to 131132331311 its reverse (113133231131), we get a palindrome (244265562442).
The spelling of 131132331311 in words is "one hundred thirty-one billion, one hundred thirty-two million, three hundred thirty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •