Search a number
-
+
131112303022009 is a prime number
BaseRepresentation
bin11101110011111011110110…
…001111110100111110111001
3122012020012202211101022220101
4131303323312033310332321
5114141120444033201014
61142504054355555401
736421360044330031
oct3563736617647671
9565205684338811
10131112303022009
113885a462a68801
1212856538bbbb61
135820ab621042a
142453c256028c1
1510257ea1c4474
hex773ef63f4fb9

131112303022009 has 2 divisors, whose sum is σ = 131112303022010. Its totient is φ = 131112303022008.

The previous prime is 131112303021983. The next prime is 131112303022031. The reversal of 131112303022009 is 900220303211131.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 128493560250000 + 2618742772009 = 11335500^2 + 1618253^2 .

It is a cyclic number.

It is not a de Polignac number, because 131112303022009 - 27 = 131112303021881 is a prime.

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

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

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

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

Almost surely, 2131112303022009 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1944, while the sum is 28.

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