Search a number
-
+
1284520953613 is a prime number
BaseRepresentation
bin10010101100010011011…
…010100100011100001101
311112210120110210102102211
4102230103122210130031
5132021144331003423
62422033433550421
7161542424645302
oct22542332443415
94483513712384
101284520953613
11455842655577
12188b47575411
139418c2517b1
14462578a50a9
152363003610d
hex12b136a470d

1284520953613 has 2 divisors, whose sum is σ = 1284520953614. Its totient is φ = 1284520953612.

The previous prime is 1284520953593. The next prime is 1284520953629. The reversal of 1284520953613 is 3163590254821.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1268770201609 + 15750752004 = 1126397^2 + 125502^2 .

It is an emirp because it is prime and its reverse (3163590254821) is a distict prime.

It is a cyclic number.

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

It is a congruent number.

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

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

Almost surely, 21284520953613 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1555200, while the sum is 49.

The spelling of 1284520953613 in words is "one trillion, two hundred eighty-four billion, five hundred twenty million, nine hundred fifty-three thousand, six hundred thirteen".