Search a number
-
+
13875927713 is a prime number
BaseRepresentation
bin11001110110001000…
…11101101010100001
31022211001000011101122
430323010131222201
5211404214141323
610212521142025
71000600303514
oct147304355241
938731004348
1013875927713
11598066595a
12283302a915
1314019ba51b
14958c1ad7b
155632c5ec8
hex33b11daa1

13875927713 has 2 divisors, whose sum is σ = 13875927714. Its totient is φ = 13875927712.

The previous prime is 13875927683. The next prime is 13875927739. The reversal of 13875927713 is 31772957831.

13875927713 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., 7241499409 + 6634428304 = 85097^2 + 81452^2 .

It is a cyclic number.

It is not a de Polignac number, because 13875927713 - 26 = 13875927649 is a prime.

It is a super-3 number, since 3×138759277133 (a number of 31 digits) contains 333 as substring.

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

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

Almost surely, 213875927713 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 2222640, while the sum is 53.

The spelling of 13875927713 in words is "thirteen billion, eight hundred seventy-five million, nine hundred twenty-seven thousand, seven hundred thirteen".