Search a number
-
+
967469141 is a prime number
BaseRepresentation
bin111001101010100…
…110100001010101
32111102110112011102
4321222212201111
53440133003031
6240000115445
732655231512
oct7152464125
92442415142
10967469141
11457124981
12230005b85
1312558a262
14926c0309
1559e077cb
hex39aa6855

967469141 has 2 divisors, whose sum is σ = 967469142. Its totient is φ = 967469140.

The previous prime is 967469119. The next prime is 967469161. The reversal of 967469141 is 141964769.

967469141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 631516900 + 335952241 = 25130^2 + 18329^2 .

It is a cyclic number.

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

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 2967469141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 326592, while the sum is 47.

The square root of 967469141 is about 31104.1659749944. The cubic root of 967469141 is about 989.0366239692.

The spelling of 967469141 in words is "nine hundred sixty-seven million, four hundred sixty-nine thousand, one hundred forty-one".