Search a number
-
+
131001103067 is a prime number
BaseRepresentation
bin111101000000001000…
…1100011001011011011
3110112010200200112212012
41322000101203023123
54121242240244232
6140103040140135
712315221001122
oct1720021431333
9415120615765
10131001103067
115061478673a
122148000764b
13c479409b03
1464aa422ab9
15361abb19b2
hex1e804632db

131001103067 has 2 divisors, whose sum is σ = 131001103068. Its totient is φ = 131001103066.

The previous prime is 131001103001. The next prime is 131001103109. The reversal of 131001103067 is 760301100131.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 131001103067 - 220 = 131000054491 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 2131001103067 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 378, while the sum is 23.

Adding to 131001103067 its reverse (760301100131), we get a palindrome (891302203198).

The spelling of 131001103067 in words is "one hundred thirty-one billion, one million, one hundred three thousand, sixty-seven".