Base | Representation |
---|---|
bin | 11101110110110100001011… |
… | …000101011101101001111001 |
3 | 122012221010122002012112201022 |
4 | 131312310023011131221321 |
5 | 114202341313101402134 |
6 | 1143135025515432225 |
7 | 36441564455404145 |
oct | 3566641305355171 |
9 | 565833562175638 |
10 | 131310221122169 |
11 | 38926396633821 |
12 | 12888973455675 |
13 | 583666810b1bb |
14 | 245d63cdca225 |
15 | 102aa309a952e |
hex | 776d0b15da79 |
131310221122169 has 2 divisors, whose sum is σ = 131310221122170. Its totient is φ = 131310221122168.
The previous prime is 131310221122103. The next prime is 131310221122177. The reversal of 131310221122169 is 961221122013131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 76685749561600 + 54624471560569 = 8757040^2 + 7390837^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131310221122169 is a prime.
It is a super-2 number, since 2×1313102211221692 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (131310221124169) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65655110561084 + 65655110561085.
It is an arithmetic number, because the mean of its divisors is an integer number (65655110561085).
Almost surely, 2131310221122169 is an apocalyptic number.
It is an amenable number.
131310221122169 is a deficient number, since it is larger than the sum of its proper divisors (1).
131310221122169 is an equidigital number, since it uses as much as digits as its factorization.
131310221122169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 35.
The spelling of 131310221122169 in words is "one hundred thirty-one trillion, three hundred ten billion, two hundred twenty-one million, one hundred twenty-two thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •