Base | Representation |
---|---|
bin | 111101000011010111… |
… | …1010101111010110101 |
3 | 110112102020210120021001 |
4 | 1322012233111322311 |
5 | 4122003022420443 |
6 | 140121513123301 |
7 | 12321006003616 |
oct | 1720657257265 |
9 | 415366716231 |
10 | 131109576373 |
11 | 5066aa352a6 |
12 | 214b03b9531 |
13 | c495a292b9 |
14 | 64ba9bbc0d |
15 | 362548bd4d |
hex | 1e86bd5eb5 |
131109576373 has 2 divisors, whose sum is σ = 131109576374. Its totient is φ = 131109576372.
The previous prime is 131109576371. The next prime is 131109576413. The reversal of 131109576373 is 373675901131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 117387093924 + 13722482449 = 342618^2 + 117143^2 .
It is a cyclic number.
It is not a de Polignac number, because 131109576373 - 21 = 131109576371 is a prime.
It is a super-3 number, since 3×1311095763733 (a number of 34 digits) contains 333 as substring.
Together with 131109576371, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131109576371) 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, 65554788186 + 65554788187.
It is an arithmetic number, because the mean of its divisors is an integer number (65554788187).
Almost surely, 2131109576373 is an apocalyptic number.
It is an amenable number.
131109576373 is a deficient number, since it is larger than the sum of its proper divisors (1).
131109576373 is an equidigital number, since it uses as much as digits as its factorization.
131109576373 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 357210, while the sum is 46.
The spelling of 131109576373 in words is "one hundred thirty-one billion, one hundred nine million, five hundred seventy-six thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •