Base | Representation |
---|---|
bin | 11101110110110111000010… |
… | …100110111100100111100101 |
3 | 122012221102120122220100210122 |
4 | 131312313002212330213211 |
5 | 114202414114313132102 |
6 | 1143140255225331325 |
7 | 36442033663502156 |
oct | 3566670246744745 |
9 | 565842518810718 |
10 | 131313300130277 |
11 | 38927726658121 |
12 | 12889492636b45 |
13 | 5836a38c964a5 |
14 | 245d851cbb92d |
15 | 102ab60e580a2 |
hex | 776dc29bc9e5 |
131313300130277 has 2 divisors, whose sum is σ = 131313300130278. Its totient is φ = 131313300130276.
The previous prime is 131313300130249. The next prime is 131313300130387. The reversal of 131313300130277 is 772031003313131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 129427619143876 + 1885680986401 = 11376626^2 + 1373201^2 .
It is a cyclic number.
It is not a de Polignac number, because 131313300130277 - 214 = 131313300113893 is a prime.
It is a super-2 number, since 2×1313133001302772 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131313300132277) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65656650065138 + 65656650065139.
It is an arithmetic number, because the mean of its divisors is an integer number (65656650065139).
Almost surely, 2131313300130277 is an apocalyptic number.
It is an amenable number.
131313300130277 is a deficient number, since it is larger than the sum of its proper divisors (1).
131313300130277 is an equidigital number, since it uses as much as digits as its factorization.
131313300130277 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 23814, while the sum is 35.
The spelling of 131313300130277 in words is "one hundred thirty-one trillion, three hundred thirteen billion, three hundred million, one hundred thirty thousand, two hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •