Search a number
-
+
1356031766153 is a prime number
BaseRepresentation
bin10011101110111001110…
…010101010111010001001
311210122011012000002111102
4103232321302222322021
5134204123113004103
62514541414511145
7166653505555241
oct23567162527211
94718135002442
101356031766153
114830a9642449
1219a9843654b5
139ab476a5a5c
14498bcdd6b21
15254180c9e88
hex13bb9caae89

1356031766153 has 2 divisors, whose sum is σ = 1356031766154. Its totient is φ = 1356031766152.

The previous prime is 1356031766149. The next prime is 1356031766179. The reversal of 1356031766153 is 3516671306531.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 786364579984 + 569667186169 = 886772^2 + 754763^2 .

It is a cyclic number.

It is not a de Polignac number, because 1356031766153 - 22 = 1356031766149 is a prime.

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

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

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

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

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

Almost surely, 21356031766153 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1020600, while the sum is 47.

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