Search a number
-
+
13955660567 is a prime number
BaseRepresentation
bin11001111111101001…
…00111101100010111
31100000121001000022022
430333310213230113
5212040122114232
610224450123355
71002556105022
oct147764475427
940017030268
1013955660567
115a11674382
12285588055b
131415386124
149656541b9
1556a2c5812
hex33fd27b17

13955660567 has 2 divisors, whose sum is σ = 13955660568. Its totient is φ = 13955660566.

The previous prime is 13955660513. The next prime is 13955660591. The reversal of 13955660567 is 76506655931.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 13955660567 - 28 = 13955660311 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 213955660567 is an apocalyptic number.

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

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

13955660567 is an evil number, because the sum of its binary digits is even.

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

The spelling of 13955660567 in words is "thirteen billion, nine hundred fifty-five million, six hundred sixty thousand, five hundred sixty-seven".