Search a number
-
+
13153314024517 is a prime number
BaseRepresentation
bin1011111101100111111010…
…0111000010110001000101
31201120110000001212221010211
42333121332213002301011
53211000441342241032
643550314332115421
72525203245325612
oct277317647026105
951513001787124
1013153314024517
11421131a951587
12158524a305b71
137454769ba514
143368a39a3509
1517c234189747
hexbf67e9c2c45

13153314024517 has 2 divisors, whose sum is σ = 13153314024518. Its totient is φ = 13153314024516.

The previous prime is 13153314024469. The next prime is 13153314024547. The reversal of 13153314024517 is 71542041335131.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 11634982398081 + 1518331626436 = 3411009^2 + 1232206^2 .

It is a cyclic number.

It is not a de Polignac number, because 13153314024517 - 223 = 13153305635909 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 213153314024517 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 151200, while the sum is 40.

Adding to 13153314024517 its reverse (71542041335131), we get a palindrome (84695355359648).

The spelling of 13153314024517 in words is "thirteen trillion, one hundred fifty-three billion, three hundred fourteen million, twenty-four thousand, five hundred seventeen".