Search a number
-
+
1525255251413 is a prime number
BaseRepresentation
bin10110001100100000010…
…011000010010111010101
312101210221122211211122112
4112030200103002113111
5144442210321021123
63124405333240405
7215124150503105
oct26144023022725
95353848754575
101525255251413
1153894790a5a3
12207730a93105
13b0aa57b085a
1453b73899205
1529a1e68bd78
hex163204c25d5

1525255251413 has 2 divisors, whose sum is σ = 1525255251414. Its totient is φ = 1525255251412.

The previous prime is 1525255251371. The next prime is 1525255251419. The reversal of 1525255251413 is 3141525525251.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1471946444644 + 53308806769 = 1213238^2 + 230887^2 .

It is a cyclic number.

It is not a de Polignac number, because 1525255251413 - 232 = 1520960284117 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

Almost surely, 21525255251413 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 300000, while the sum is 41.

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