Search a number
-
+
158093721613 is a prime number
BaseRepresentation
bin1001001100111100011…
…1101100000000001101
3120010001211020011122201
42103033013230000031
510042233443042423
6200343253041501
714264465314162
oct2231707540015
9503054204581
10158093721613
1161057869a83
1226781326291
1311ba6348449
14791a694069
1541a443e2ad
hex24cf1ec00d

158093721613 has 2 divisors, whose sum is σ = 158093721614. Its totient is φ = 158093721612.

The previous prime is 158093721581. The next prime is 158093721631. The reversal of 158093721613 is 316127390851.

It is a happy number.

Together with next prime (158093721631) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 148315873924 + 9777847689 = 385118^2 + 98883^2 .

It is a cyclic number.

It is not a de Polignac number, because 158093721613 - 25 = 158093721581 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2158093721613 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 272160, while the sum is 46.

The spelling of 158093721613 in words is "one hundred fifty-eight billion, ninety-three million, seven hundred twenty-one thousand, six hundred thirteen".