Base | Representation |
---|---|
bin | 11000100110111000… |
… | …11101110011110001 |
3 | 1021002201001222220122 |
4 | 30103130131303301 |
5 | 204024022143441 |
6 | 10022532220025 |
7 | 645245522156 |
oct | 142334356361 |
9 | 37081058818 |
10 | 13211131121 |
11 | 566a380391 |
12 | 268846a615 |
13 | 1327055666 |
14 | 8d480822d |
15 | 524c5934b |
hex | 31371dcf1 |
13211131121 has 2 divisors, whose sum is σ = 13211131122. Its totient is φ = 13211131120.
The previous prime is 13211131117. The next prime is 13211131123. The reversal of 13211131121 is 12113111231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12981184225 + 229946896 = 113935^2 + 15164^2 .
It is a cyclic number.
It is not a de Polignac number, because 13211131121 - 22 = 13211131117 is a prime.
Together with 13211131123, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13211131121.
It is not a weakly prime, because it can be changed into another prime (13211131123) 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 as a sum of consecutive naturals, namely, 6605565560 + 6605565561.
It is an arithmetic number, because the mean of its divisors is an integer number (6605565561).
Almost surely, 213211131121 is an apocalyptic number.
It is an amenable number.
13211131121 is a deficient number, since it is larger than the sum of its proper divisors (1).
13211131121 is an equidigital number, since it uses as much as digits as its factorization.
13211131121 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 36, while the sum is 17.
Adding to 13211131121 its reverse (12113111231), we get a palindrome (25324242352).
The spelling of 13211131121 in words is "thirteen billion, two hundred eleven million, one hundred thirty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •