Search a number
-
+
11316053713 is a prime number
BaseRepresentation
bin10101000100111110…
…10100011011010001
31002012122011002102111
422202133110123101
5141133402204323
65110514145321
7550264604146
oct124237243321
932178132374
1011316053713
114887687708
122239882241
1310b4556593
14794c623cd
154636bec0d
hex2a27d46d1

11316053713 has 2 divisors, whose sum is σ = 11316053714. Its totient is φ = 11316053712.

The previous prime is 11316053657. The next prime is 11316053729. The reversal of 11316053713 is 31735061311.

11316053713 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., 10889548609 + 426505104 = 104353^2 + 20652^2 .

It is a cyclic number.

It is not a de Polignac number, because 11316053713 - 221 = 11313956561 is a prime.

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

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

Almost surely, 211316053713 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5670, while the sum is 31.

The spelling of 11316053713 in words is "eleven billion, three hundred sixteen million, fifty-three thousand, seven hundred thirteen".