Base | Representation |
---|---|
bin | 11101110110110011111110… |
… | …101100101100000110110011 |
3 | 122012221010002121011010220022 |
4 | 131312303332230230012303 |
5 | 114202340401401114141 |
6 | 1143134553133234055 |
7 | 36441556353064055 |
oct | 3566637654540663 |
9 | 565833077133808 |
10 | 131310013301171 |
11 | 3892629a299831 |
12 | 1288891593292b |
13 | 58366340460b3 |
14 | 245d61d56d8d5 |
15 | 102aa1c607b4b |
hex | 776cfeb2c1b3 |
131310013301171 has 2 divisors, whose sum is σ = 131310013301172. Its totient is φ = 131310013301170.
The previous prime is 131310013301161. The next prime is 131310013301183. The reversal of 131310013301171 is 171103310013131.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131310013301171 is a prime.
It is a super-2 number, since 2×1313100133011712 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 131310013301171.
It is not a weakly prime, because it can be changed into another prime (131310013301161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65655006650585 + 65655006650586.
It is an arithmetic number, because the mean of its divisors is an integer number (65655006650586).
Almost surely, 2131310013301171 is an apocalyptic number.
131310013301171 is a deficient number, since it is larger than the sum of its proper divisors (1).
131310013301171 is an equidigital number, since it uses as much as digits as its factorization.
131310013301171 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 567, while the sum is 26.
The spelling of 131310013301171 in words is "one hundred thirty-one trillion, three hundred ten billion, thirteen million, three hundred one thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •