Search a number
-
+
1005110561029 is a prime number
BaseRepresentation
bin11101010000001010100…
…00100000100100000101
310120002100212211211021011
432220011100200210011
5112431431300423104
62045424051322221
7132421401542611
oct16500520404405
93502325754234
101005110561029
113582a0788053
121429695b0371
1373a20cc7c53
143690d088341
151b22a25b904
hexea05420905

1005110561029 has 2 divisors, whose sum is σ = 1005110561030. Its totient is φ = 1005110561028.

The previous prime is 1005110561023. The next prime is 1005110561057. The reversal of 1005110561029 is 9201650115001.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 746492544004 + 258618017025 = 863998^2 + 508545^2 .

It is a cyclic number.

It is not a de Polignac number, because 1005110561029 - 25 = 1005110560997 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 21005110561029 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2700, while the sum is 31.

The spelling of 1005110561029 in words is "one trillion, five billion, one hundred ten million, five hundred sixty-one thousand, twenty-nine".