Search a number
-
+
2524533425231 is a prime number
BaseRepresentation
bin100100101111001001111…
…010110000010001001111
322221100021002000200202112
4210233021322300101033
5312330221024101411
65211431000414235
7350251202024456
oct44571172602117
98840232020675
102524533425231
11893715338824
1234933117737b
131540a73675bc
148a28c0c5b9d
1545a0786db8b
hex24bc9eb044f

2524533425231 has 2 divisors, whose sum is σ = 2524533425232. Its totient is φ = 2524533425230.

The previous prime is 2524533425209. The next prime is 2524533425233. The reversal of 2524533425231 is 1325243354252.

2524533425231 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 2524533425231 - 238 = 2249655518287 is a prime.

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

Together with 2524533425233, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 22524533425231 is an apocalyptic number.

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

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

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

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

Adding to 2524533425231 its reverse (1325243354252), we get a palindrome (3849776779483).

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