Search a number
-
+
67036736693 is a prime number
BaseRepresentation
bin111110011011101100…
…110110110010110101
320102000220110001210202
4332123230312302311
52044242401033233
650443553530245
74562142601013
oct763354666265
9212026401722
1067036736693
1126480543533
1210baa573985
136424556504
14335d2538b3
151b253c6be8
hexf9bb36cb5

67036736693 has 2 divisors, whose sum is σ = 67036736694. Its totient is φ = 67036736692.

The previous prime is 67036736651. The next prime is 67036736699. The reversal of 67036736693 is 39663763076.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 48256226929 + 18780509764 = 219673^2 + 137042^2 .

It is a cyclic number.

It is not a de Polignac number, because 67036736693 - 210 = 67036735669 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (67036736699) 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, 33518368346 + 33518368347.

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

Almost surely, 267036736693 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 15431472, while the sum is 56.

The spelling of 67036736693 in words is "sixty-seven billion, thirty-six million, seven hundred thirty-six thousand, six hundred ninety-three".