Search a number
-
+
131618257 is a prime number
BaseRepresentation
bin1111101100001…
…01010111010001
3100011122220022021
413312011113101
5232143241012
621021011441
73155510461
oct766052721
9304586267
10131618257
1168327821
12380b3b81
1321364234
14136a1ba1
15b84d007
hex7d855d1

131618257 has 2 divisors, whose sum is σ = 131618258. Its totient is φ = 131618256.

The previous prime is 131618243. The next prime is 131618293. The reversal of 131618257 is 752816131.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 108347281 + 23270976 = 10409^2 + 4824^2 .

It is an emirp because it is prime and its reverse (752816131) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 131618257 - 211 = 131616209 is a prime.

It is a super-3 number, since 3×1316182573 (a number of 25 digits) contains 333 as substring.

It is the 11473-rd Hogben number.

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

It is a nontrivial repunit in base 11472.

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

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

Almost surely, 2131618257 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 10080, while the sum is 34.

The square root of 131618257 is about 11472.5000326869. The cubic root of 131618257 is about 508.6730299073.

It can be divided in two parts, 13 and 1618257, that multiplied together give a triangular number (21037341 = T6486).

The spelling of 131618257 in words is "one hundred thirty-one million, six hundred eighteen thousand, two hundred fifty-seven".