Search a number
-
+
1327153615351 is a prime number
BaseRepresentation
bin10011010100000000100…
…001010001000111110111
311200212121121200000220121
4103110000201101013313
5133221002311142401
62453404055512411
7164612050412614
oct23240041210767
94625547600817
101327153615351
1147192a687313
12195265088707
13981c4871665
144833d97750b
15247c7c00ca1
hex135008511f7

1327153615351 has 2 divisors, whose sum is σ = 1327153615352. Its totient is φ = 1327153615350.

The previous prime is 1327153615297. The next prime is 1327153615423. The reversal of 1327153615351 is 1535163517231.

It is a weak prime.

It is an emirp because it is prime and its reverse (1535163517231) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1327153615351 - 219 = 1327153091063 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 21327153615351 is an apocalyptic number.

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

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

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

The product of its digits is 283500, while the sum is 43.

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