Search a number
-
+
1005115405681 is a prime number
BaseRepresentation
bin11101010000001011000…
…10111111010101110001
310120002101012221221212201
432220011202333111301
5112431434020440211
62045424343223201
7132421460661142
oct16500542772561
93502335857781
101005115405681
113582a34969a2
1214296b147b01
1373a220030ca
143690d989ac9
151b22a8b70c1
hexea058bf571

1005115405681 has 2 divisors, whose sum is σ = 1005115405682. Its totient is φ = 1005115405680.

The previous prime is 1005115405513. The next prime is 1005115405717. The reversal of 1005115405681 is 1865045115001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 626022758656 + 379092647025 = 791216^2 + 615705^2 .

It is a cyclic number.

It is not a de Polignac number, because 1005115405681 - 217 = 1005115274609 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 1005115405681.

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

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

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

Almost surely, 21005115405681 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 24000, while the sum is 37.

The spelling of 1005115405681 in words is "one trillion, five billion, one hundred fifteen million, four hundred five thousand, six hundred eighty-one".