Search a number
-
+
131201321131469 is a prime number
BaseRepresentation
bin11101110101001110110000…
…001000111101110111001101
3122012112201112122122211102102
4131311032300020331313031
5114144100301202201334
61143013015503004445
736430661021635661
oct3565166010756715
9565481478584372
10131201321131469
1138894193404a06
121286b840b99725
135829301796294
14245826bd488a1
151027caa24a67e
hex7753b023ddcd

131201321131469 has 2 divisors, whose sum is σ = 131201321131470. Its totient is φ = 131201321131468.

The previous prime is 131201321131427. The next prime is 131201321131477. The reversal of 131201321131469 is 964131123102131.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 127915240441444 + 3286080690025 = 11309962^2 + 1812755^2 .

It is a cyclic number.

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

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

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

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

Almost surely, 2131201321131469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 23328, while the sum is 38.

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