Search a number
-
+
2522521229 is a prime number
BaseRepresentation
bin1001011001011010…
…1001111010001101
320111210120100121012
42112112221322031
520131231134404
61054150215005
7116340035204
oct22626517215
96453510535
102522521229
111084996598
125a4954465
133127b6317
1419d03423b
15eb6c8a6e
hex965a9e8d

2522521229 has 2 divisors, whose sum is σ = 2522521230. Its totient is φ = 2522521228.

The previous prime is 2522521219. The next prime is 2522521307. The reversal of 2522521229 is 9221252252.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 2495502025 + 27019204 = 49955^2 + 5198^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-2522521229 is a prime.

It is a super-2 number, since 2×25225212292 = 12726226701511340882, which contains 22 as substring.

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

It is a congruent number.

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

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

Almost surely, 22522521229 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 14400, while the sum is 32.

The square root of 2522521229 is about 50224.7073560414. The cubic root of 2522521229 is about 1361.2720992892.

The spelling of 2522521229 in words is "two billion, five hundred twenty-two million, five hundred twenty-one thousand, two hundred twenty-nine".