Search a number
-
+
1496739366013 is a prime number
BaseRepresentation
bin10101110001111100100…
…111100100010001111101
312022002100100011202202211
4111301330213210101331
5144010310234203023
63103331555020421
7213064411461013
oct25617447442175
95262310152684
101496739366013
11527844396861
122020b2b9a711
13ab1aca38398
145262a5ba8b3
1528e00ec0a0d
hex15c7c9e447d

1496739366013 has 2 divisors, whose sum is σ = 1496739366014. Its totient is φ = 1496739366012.

The previous prime is 1496739365993. The next prime is 1496739366043. The reversal of 1496739366013 is 3106639376941.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1064863014084 + 431876351929 = 1031922^2 + 657173^2 .

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

It is a cyclic number.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 21496739366013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 13226976, while the sum is 58.

The spelling of 1496739366013 in words is "one trillion, four hundred ninety-six billion, seven hundred thirty-nine million, three hundred sixty-six thousand, thirteen".