Search a number
-
+
1525135200473 is a prime number
BaseRepresentation
bin10110001100011001001…
…001000101000011011001
312101210122021221121201102
4112030121021011003121
5144441434102403343
63124345404201145
7215121162210263
oct26143111050331
95353567847642
101525135200473
11538896073545
122076b88391b5
13b0a869696b1
1453b61968b33
1529a13d763b8
hex163192450d9

1525135200473 has 2 divisors, whose sum is σ = 1525135200474. Its totient is φ = 1525135200472.

The previous prime is 1525135200437. The next prime is 1525135200481. The reversal of 1525135200473 is 3740025315251.

Together with previous prime (1525135200437) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1264965835849 + 260169364624 = 1124707^2 + 510068^2 .

It is a cyclic number.

It is not a de Polignac number, because 1525135200473 - 216 = 1525135134937 is a prime.

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

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

Almost surely, 21525135200473 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 1525135200473 in words is "one trillion, five hundred twenty-five billion, one hundred thirty-five million, two hundred thousand, four hundred seventy-three".