Search a number
-
+
60436673260013 is a prime number
BaseRepresentation
bin11011011110111100000100…
…11100001110100111101101
321220222200121200011112010102
431233132002130032213231
530410143301323310023
6332312120245520445
715505256050415021
oct1557360234164755
9256880550145112
1060436673260013
111829105a524556
126941047713125
1327951ccc8688b
1410cd21732a381
156ec16ad9c628
hex36f78270e9ed

60436673260013 has 2 divisors, whose sum is σ = 60436673260014. Its totient is φ = 60436673260012.

The previous prime is 60436673259979. The next prime is 60436673260039. The reversal of 60436673260013 is 31006237663406.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 55732988495209 + 4703684764804 = 7465453^2 + 2168798^2 .

It is a cyclic number.

It is not a de Polignac number, because 60436673260013 - 228 = 60436404824557 is a prime.

It is a super-2 number, since 2×604366732600132 (a number of 28 digits) contains 22 as substring.

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

It is a congruent number.

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

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

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

Almost surely, 260436673260013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1959552, while the sum is 47.

The spelling of 60436673260013 in words is "sixty trillion, four hundred thirty-six billion, six hundred seventy-three million, two hundred sixty thousand, thirteen".