Search a number
-
+
11727150236413 is a prime number
BaseRepresentation
bin1010101010100111000010…
…0111111100001011111101
31112112002211021002222200221
42222221300213330023331
53014114200430031123
640535213424421341
72320154500206133
oct252516047741375
945462737088627
1011727150236413
113811502645017
121394972a77851
13670b33724231
142c7850629753
151550b40c125d
hexaaa709fc2fd

11727150236413 has 2 divisors, whose sum is σ = 11727150236414. Its totient is φ = 11727150236412.

The previous prime is 11727150236387. The next prime is 11727150236521. The reversal of 11727150236413 is 31463205172711.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 11532530737764 + 194619498649 = 3395958^2 + 441157^2 .

It is a cyclic number.

It is not a de Polignac number, because 11727150236413 - 29 = 11727150235901 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 211727150236413 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 211680, while the sum is 43.

The spelling of 11727150236413 in words is "eleven trillion, seven hundred twenty-seven billion, one hundred fifty million, two hundred thirty-six thousand, four hundred thirteen".