Base | Representation |
---|---|
bin | 111101001001101101… |
… | …0110111100110011101 |
3 | 110112222002002201012201 |
4 | 1322103122313212131 |
5 | 4122422003004432 |
6 | 140154552531501 |
7 | 12326201146432 |
oct | 1722332674635 |
9 | 415862081181 |
10 | 131322313117 |
11 | 5076a027596 |
12 | 2154b6b0b91 |
13 | c4cab22a28 |
14 | 64dad57b89 |
15 | 3638eaeee7 |
hex | 1e936b799d |
131322313117 has 2 divisors, whose sum is σ = 131322313118. Its totient is φ = 131322313116.
The previous prime is 131322313097. The next prime is 131322313139. The reversal of 131322313117 is 711313223131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 78784630596 + 52537682521 = 280686^2 + 229211^2 .
It is a cyclic number.
It is not a de Polignac number, because 131322313117 - 223 = 131313924509 is a prime.
It is a super-3 number, since 3×1313223131173 (a number of 34 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131322313417) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65661156558 + 65661156559.
It is an arithmetic number, because the mean of its divisors is an integer number (65661156559).
Almost surely, 2131322313117 is an apocalyptic number.
It is an amenable number.
131322313117 is a deficient number, since it is larger than the sum of its proper divisors (1).
131322313117 is an equidigital number, since it uses as much as digits as its factorization.
131322313117 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2268, while the sum is 28.
Adding to 131322313117 its reverse (711313223131), we get a palindrome (842635536248).
The spelling of 131322313117 in words is "one hundred thirty-one billion, three hundred twenty-two million, three hundred thirteen thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •