Search a number
-
+
131110097057 is a prime number
BaseRepresentation
bin111101000011011000…
…1010101000010100001
3110112102021210000111122
41322012301111002201
54122003141101212
6140121532222025
712321013302632
oct1720661250241
9415367700448
10131110097057
1150670260515
12214b060a915
13c495b7c2b4
1464baab5889
153625541272
hex1e86c550a1

131110097057 has 2 divisors, whose sum is σ = 131110097058. Its totient is φ = 131110097056.

The previous prime is 131110097047. The next prime is 131110097077. The reversal of 131110097057 is 750790011131.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 129860050321 + 1250046736 = 360361^2 + 35356^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-131110097057 is a prime.

It is a super-2 number, since 2×1311100970572 (a number of 23 digits) contains 22 as substring.

It is not a weakly prime, because it can be changed into another prime (131110097017) by changing a digit.

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

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

Almost surely, 2131110097057 is an apocalyptic number.

It is an amenable number.

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

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

131110097057 is an evil number, because the sum of its binary digits is even.

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

The spelling of 131110097057 in words is "one hundred thirty-one billion, one hundred ten million, ninety-seven thousand, fifty-seven".