Search a number
-
+
67037067961 is a prime number
BaseRepresentation
bin111110011011101110…
…000111101010111001
320102000221001220012221
4332123232013222321
52044242442133321
650444005004041
74562145450553
oct763356075271
9212027056187
1067037067961
112648074a406
1210baa6b3621
136424641226
14335d2dc4d3
151b2543ee41
hexf9bb87ab9

67037067961 has 2 divisors, whose sum is σ = 67037067962. Its totient is φ = 67037067960.

The previous prime is 67037067959. The next prime is 67037067991. The reversal of 67037067961 is 16976073076.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 34537992336 + 32499075625 = 185844^2 + 180275^2 .

It is a cyclic number.

It is not a de Polignac number, because 67037067961 - 21 = 67037067959 is a prime.

Together with 67037067959, it forms a pair of twin primes.

It is a junction number, because it is equal to n+sod(n) for n = 67037067899 and 67037067908.

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

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

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

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

Almost surely, 267037067961 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2000376, while the sum is 52.

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