Search a number
-
+
913665478969 is a prime number
BaseRepresentation
bin11010100101110101011…
…01001101000100111001
310020100022220210100020001
431102322231031010321
5104432141330311334
61535422050033001
7123003324301045
oct15227255150471
93210286710201
10913665478969
11322535386471
121290a8878761
13682099a1439
14323162a1025
1518b770d2714
hexd4bab4d139

913665478969 has 2 divisors, whose sum is σ = 913665478970. Its totient is φ = 913665478968.

The previous prime is 913665478967. The next prime is 913665479107. The reversal of 913665478969 is 969874566319.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 806466861225 + 107198617744 = 898035^2 + 327412^2 .

It is an emirp because it is prime and its reverse (969874566319) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 913665478969 - 21 = 913665478967 is a prime.

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

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

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

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

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

Almost surely, 2913665478969 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 529079040, while the sum is 73.

The spelling of 913665478969 in words is "nine hundred thirteen billion, six hundred sixty-five million, four hundred seventy-eight thousand, nine hundred sixty-nine".