Search a number
-
+
1336156115051 is a prime number
BaseRepresentation
bin10011011100011001000…
…111000101000001101011
311201201212000110101212102
4103130121013011001223
5133342421431140201
62501453250404015
7165351123404462
oct23343107050153
94651760411772
101336156115051
1147572a32560a
12196b57b9060b
1398cca9b8664
144895543d9d9
1524b5322326b
hex137191c506b

1336156115051 has 2 divisors, whose sum is σ = 1336156115052. Its totient is φ = 1336156115050.

The previous prime is 1336156115009. The next prime is 1336156115057. The reversal of 1336156115051 is 1505116516331.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1336156115051 - 26 = 1336156114987 is a prime.

It is a super-3 number, since 3×13361561150513 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

It is a Sophie Germain prime.

It is a junction number, because it is equal to n+sod(n) for n = 1336156114996 and 1336156115014.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 21336156115051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 40500, while the sum is 38.

The spelling of 1336156115051 in words is "one trillion, three hundred thirty-six billion, one hundred fifty-six million, one hundred fifteen thousand, fifty-one".