Search a number
-
+
13026016165993 is a prime number
BaseRepresentation
bin1011110110001101101100…
…0100010000000001101001
31201010021102110111200202221
42331203123010100001221
53201404240114302433
643412022541154041
72513045552354005
oct275433304200151
951107373450687
1013026016165993
1141723365a1326
12156464255b921
1373646a89c08c
14330669327705
15178c8368072d
hexbd8db110069

13026016165993 has 2 divisors, whose sum is σ = 13026016165994. Its totient is φ = 13026016165992.

The previous prime is 13026016165961. The next prime is 13026016166069. The reversal of 13026016165993 is 39956161062031.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 12460921180009 + 565094985984 = 3530003^2 + 751728^2 .

It is a cyclic number.

It is not a de Polignac number, because 13026016165993 - 25 = 13026016165961 is a prime.

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

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

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

Almost surely, 213026016165993 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1574640, while the sum is 52.

The spelling of 13026016165993 in words is "thirteen trillion, twenty-six billion, sixteen million, one hundred sixty-five thousand, nine hundred ninety-three".