Search a number
-
+
13406809253 is a prime number
BaseRepresentation
bin11000111110001101…
…11010110010100101
31021121100021110211212
430133012322302211
5204424120344003
610054202241205
7653142666305
oct143706726245
937540243755
1013406809253
11575a881252
122721ab6205
131358758736
149127c3605
1553700cdd8
hex31f1baca5

13406809253 has 2 divisors, whose sum is σ = 13406809254. Its totient is φ = 13406809252.

The previous prime is 13406809249. The next prime is 13406809349. The reversal of 13406809253 is 35290860431.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 13307468164 + 99341089 = 115358^2 + 9967^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 13406809253 - 22 = 13406809249 is a prime.

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

It is a congruent number.

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

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

Almost surely, 213406809253 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 155520, while the sum is 41.

The spelling of 13406809253 in words is "thirteen billion, four hundred six million, eight hundred nine thousand, two hundred fifty-three".