Search a number
-
+
1351505252453 is a prime number
BaseRepresentation
bin10011101010101011111…
…111011001000001100101
311210012110201120101000212
4103222223333121001211
5134120340321034303
62512512315545205
7166433363046266
oct23525377310145
94705421511025
101351505252453
11481196532734
12199b2045b205
139a5a5978095
14495adb8896d
1525250a00ad8
hex13aabfd9065

1351505252453 has 2 divisors, whose sum is σ = 1351505252454. Its totient is φ = 1351505252452.

The previous prime is 1351505252389. The next prime is 1351505252497. The reversal of 1351505252453 is 3542525051531.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1016422879684 + 335082372769 = 1008178^2 + 578863^2 .

It is a cyclic number.

It is not a de Polignac number, because 1351505252453 - 26 = 1351505252389 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21351505252453 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 450000, while the sum is 41.

The spelling of 1351505252453 in words is "one trillion, three hundred fifty-one billion, five hundred five million, two hundred fifty-two thousand, four hundred fifty-three".