Search a number
-
+
131011131211469 is a prime number
BaseRepresentation
bin11101110010011101100111…
…111011111111111011001101
3122011212112121222202211210022
4131302131213323333323031
5114132441244042231334
61142345403252551525
736411145651201205
oct3562354773777315
9564775558684708
10131011131211469
1138820566130043
121283aa029225a5
1358143b19c9392
14244cd88aad405
151022d7816b82e
hex772767effecd

131011131211469 has 2 divisors, whose sum is σ = 131011131211470. Its totient is φ = 131011131211468.

The previous prime is 131011131211351. The next prime is 131011131211483. The reversal of 131011131211469 is 964112131110131.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 125419504837225 + 5591626374244 = 11199085^2 + 2364662^2 .

It is a cyclic number.

It is not a de Polignac number, because 131011131211469 - 216 = 131011131145933 is a prime.

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

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

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

Almost surely, 2131011131211469 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 131011131211469 in words is "one hundred thirty-one trillion, eleven billion, one hundred thirty-one million, two hundred eleven thousand, four hundred sixty-nine".