Search a number
-
+
97965476369 is a prime number
BaseRepresentation
bin101101100111100110…
…0101000101000010001
3100100212101022211111122
41123033030220220101
53101113130220434
6113001004052025
710035450544505
oct1331714505021
9310771284448
1097965476369
1138601a59412
1216ba0534015
1393131683c7
144a54b7a305
152835807c2e
hex16cf328a11

97965476369 has 2 divisors, whose sum is σ = 97965476370. Its totient is φ = 97965476368.

The previous prime is 97965476341. The next prime is 97965476381. The reversal of 97965476369 is 96367456979.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 97209886225 + 755590144 = 311785^2 + 27488^2 .

It is a cyclic number.

It is not a de Polignac number, because 97965476369 - 28 = 97965476113 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

Almost surely, 297965476369 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 462944160, while the sum is 71.

The spelling of 97965476369 in words is "ninety-seven billion, nine hundred sixty-five million, four hundred seventy-six thousand, three hundred sixty-nine".