Search a number
-
+
11683387101401 is a prime number
BaseRepresentation
bin1010101000000100000000…
…1000110101000011011001
31112100220212100001101102122
42222001000020311003121
53012410034044221101
640503135100511025
72314045136536211
oct252010010650331
945326770041378
1011683387101401
1137a4995484a44
12138839a84b475
1366997ab44182
142c569c365241
15153da205151b
hexaa0402350d9

11683387101401 has 2 divisors, whose sum is σ = 11683387101402. Its totient is φ = 11683387101400.

The previous prime is 11683387101383. The next prime is 11683387101431. The reversal of 11683387101401 is 10410178338611.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10510012867225 + 1173374234176 = 3241915^2 + 1083224^2 .

It is a cyclic number.

It is not a de Polignac number, because 11683387101401 - 214 = 11683387085017 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

Almost surely, 211683387101401 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 96768, while the sum is 44.

The spelling of 11683387101401 in words is "eleven trillion, six hundred eighty-three billion, three hundred eighty-seven million, one hundred one thousand, four hundred one".