Base | Representation |
---|---|
bin | 11000100110111010… |
… | …01110101000111011 |
3 | 1021002201110011021102 |
4 | 30103131032220323 |
5 | 204024100044011 |
6 | 10022540402015 |
7 | 645250314245 |
oct | 142335165073 |
9 | 37081404242 |
10 | 13211331131 |
11 | 566a4a7689 |
12 | 268854630b |
13 | 13270c56cb |
14 | 8d485b095 |
15 | 524c9873b |
hex | 31374ea3b |
13211331131 has 4 divisors (see below), whose sum is σ = 13250534232. Its totient is φ = 13172128032.
The previous prime is 13211331113. The next prime is 13211331151. The reversal of 13211331131 is 13113311231.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13113311231 = 4919 ⋅2665849.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13211331131 is a prime.
It is a super-2 number, since 2×132113311312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13211331151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19601045 + ... + 19601718.
It is an arithmetic number, because the mean of its divisors is an integer number (3312633558).
Almost surely, 213211331131 is an apocalyptic number.
13211331131 is a deficient number, since it is larger than the sum of its proper divisors (39203101).
13211331131 is an equidigital number, since it uses as much as digits as its factorization.
13211331131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39203100.
The product of its digits is 162, while the sum is 20.
Adding to 13211331131 its reverse (13113311231), we get a palindrome (26324642362).
The spelling of 13211331131 in words is "thirteen billion, two hundred eleven million, three hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •