Search a number
-
+
1005212762513 is a prime number
BaseRepresentation
bin11101010000010110101…
…10011000000110010001
310120002122000011012100022
432220023112120012101
5112432133431400023
62045442142033225
7132424052334251
oct16501326300621
93502560135308
101005212762513
11358343442593
12142997878815
1373a3922c7bb
143691c88d961
151b2341e87c8
hexea0b598191

1005212762513 has 2 divisors, whose sum is σ = 1005212762514. Its totient is φ = 1005212762512.

The previous prime is 1005212762459. The next prime is 1005212762531. The reversal of 1005212762513 is 3152672125001.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 991123784704 + 14088977809 = 995552^2 + 118697^2 .

It is a cyclic number.

It is not a de Polignac number, because 1005212762513 - 220 = 1005211713937 is a prime.

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

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

Almost surely, 21005212762513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 25200, while the sum is 35.

Adding to 1005212762513 its reverse (3152672125001), we get a palindrome (4157884887514).

The spelling of 1005212762513 in words is "one trillion, five billion, two hundred twelve million, seven hundred sixty-two thousand, five hundred thirteen".