Base | Representation |
---|---|
bin | 111101001001010110… |
… | …0010010011011001101 |
3 | 110112221020010100000022 |
4 | 1322102230102123031 |
5 | 4122410341232341 |
6 | 140153435111525 |
7 | 12325662311234 |
oct | 1722254223315 |
9 | 415836110008 |
10 | 131310102221 |
11 | 50763147341 |
12 | 215475a25a5 |
13 | c4c8438a4c |
14 | 64d9499b1b |
15 | 3637d9be4b |
hex | 1e92b126cd |
131310102221 has 2 divisors, whose sum is σ = 131310102222. Its totient is φ = 131310102220.
The previous prime is 131310102199. The next prime is 131310102229. The reversal of 131310102221 is 122201013131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 129229465225 + 2080636996 = 359485^2 + 45614^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131310102221 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 131310102221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131310102229) 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, 65655051110 + 65655051111.
It is an arithmetic number, because the mean of its divisors is an integer number (65655051111).
Almost surely, 2131310102221 is an apocalyptic number.
It is an amenable number.
131310102221 is a deficient number, since it is larger than the sum of its proper divisors (1).
131310102221 is an equidigital number, since it uses as much as digits as its factorization.
131310102221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 131310102221 its reverse (122201013131), we get a palindrome (253511115352).
The spelling of 131310102221 in words is "one hundred thirty-one billion, three hundred ten million, one hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •