Search a number
-
+
1005521131 is a prime number
BaseRepresentation
bin111011111011110…
…000100011101011
32121002001202200101
4323323300203223
54024403134011
6243435450231
733626534326
oct7373604353
92532052611
101005521131
114766549aa
122408b6977
13130421224
14977877bd
155d4222c1
hex3bef08eb

1005521131 has 2 divisors, whose sum is σ = 1005521132. Its totient is φ = 1005521130.

The previous prime is 1005521113. The next prime is 1005521137. The reversal of 1005521131 is 1311255001.

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

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1005521131 - 27 = 1005521003 is a prime.

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

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

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 21005521131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 150, while the sum is 19.

The square root of 1005521131 is about 31709.9531850805. The cubic root of 1005521131 is about 1001.8370003633.

Adding to 1005521131 its reverse (1311255001), we get a palindrome (2316776132).

The spelling of 1005521131 in words is "one billion, five million, five hundred twenty-one thousand, one hundred thirty-one".