Search a number
-
+
131045402112173 is a prime number
BaseRepresentation
bin11101110010111101100010…
…101001000111000010101101
3122011222211002101111222111222
4131302331202221013002231
5114134021440420042143
61142413232053153125
736413501141065463
oct3562754251070255
9564884071458458
10131045402112173
1138834052166a7a
121284558802b7a5
1358176b3b62953
1424508ba428833
151023bd1bcc768
hex772f62a470ad

131045402112173 has 2 divisors, whose sum is σ = 131045402112174. Its totient is φ = 131045402112172.

The previous prime is 131045402112091. The next prime is 131045402112199. The reversal of 131045402112173 is 371211204540131.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 130917121377604 + 128280734569 = 11441902^2 + 358163^2 .

It is a cyclic number.

It is not a de Polignac number, because 131045402112173 - 214 = 131045402095789 is a prime.

It is a super-2 number, since 2×1310454021121732 (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 (131045402112473) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65522701056086 + 65522701056087.

It is an arithmetic number, because the mean of its divisors is an integer number (65522701056087).

Almost surely, 2131045402112173 is an apocalyptic number.

It is an amenable number.

131045402112173 is a deficient number, since it is larger than the sum of its proper divisors (1).

131045402112173 is an equidigital number, since it uses as much as digits as its factorization.

131045402112173 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 20160, while the sum is 35.

The spelling of 131045402112173 in words is "one hundred thirty-one trillion, forty-five billion, four hundred two million, one hundred twelve thousand, one hundred seventy-three".