Search a number
-
+
14317058969 is a prime number
BaseRepresentation
bin11010101010101110…
…01111101110011001
31100221210001221201022
431111113033232121
5213310131341334
610324400132225
71014534664463
oct152527175631
940853057638
1014317058969
116087674344
122936907075
131472200535
1499b64b133
1558bdb182e
hex3555cfb99

14317058969 has 2 divisors, whose sum is σ = 14317058970. Its totient is φ = 14317058968.

The previous prime is 14317058957. The next prime is 14317058971. The reversal of 14317058969 is 96985071341.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10129416025 + 4187642944 = 100645^2 + 64712^2 .

It is a cyclic number.

It is not a de Polignac number, because 14317058969 - 24 = 14317058953 is a prime.

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

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

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 14317058969.

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

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

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

Almost surely, 214317058969 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1632960, while the sum is 53.

The spelling of 14317058969 in words is "fourteen billion, three hundred seventeen million, fifty-eight thousand, nine hundred sixty-nine".