Base | Representation |
---|---|
bin | 11101110111010010111010… |
… | …101100000010111101111101 |
3 | 122020001021211200000220220211 |
4 | 131313102322230002331331 |
5 | 114203411414344122344 |
6 | 1143202125305512421 |
7 | 36444143505405616 |
oct | 3567227254027575 |
9 | 566037750026824 |
10 | 131343232020349 |
11 | 38939396401158 |
12 | 128932467a2711 |
13 | 58397c920214b |
14 | 2461091276c0d |
15 | 102b813acb334 |
hex | 7774bab02f7d |
131343232020349 has 2 divisors, whose sum is σ = 131343232020350. Its totient is φ = 131343232020348.
The previous prime is 131343232020289. The next prime is 131343232020601. The reversal of 131343232020349 is 943020232343131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 110180563936249 + 21162668084100 = 10496693^2 + 4600290^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131343232020349 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131343232024349) 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, 65671616010174 + 65671616010175.
It is an arithmetic number, because the mean of its divisors is an integer number (65671616010175).
Almost surely, 2131343232020349 is an apocalyptic number.
It is an amenable number.
131343232020349 is a deficient number, since it is larger than the sum of its proper divisors (1).
131343232020349 is an equidigital number, since it uses as much as digits as its factorization.
131343232020349 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 279936, while the sum is 40.
The spelling of 131343232020349 in words is "one hundred thirty-one trillion, three hundred forty-three billion, two hundred thirty-two million, twenty thousand, three hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •