Search a number
-
+
314530426719611 is a prime number
BaseRepresentation
bin100011110000100000101001…
…0010110110000110101111011
31112020122211000020022202111022
41013201001102112300311323
5312211231303220011421
63032541141104453055
7123152034120644414
oct10741012226606573
91466584006282438
10314530426719611
1191245672101373
122b33a12b61a18b
13106671270a701b
1457954d509080b
1526569d16a97ab
hex11e10525b0d7b

314530426719611 has 2 divisors, whose sum is σ = 314530426719612. Its totient is φ = 314530426719610.

The previous prime is 314530426719581. The next prime is 314530426719631. The reversal of 314530426719611 is 116917624035413.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 314530426719611 - 222 = 314530422525307 is a prime.

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

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

Almost surely, 2314530426719611 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 3265920, while the sum is 53.

The spelling of 314530426719611 in words is "three hundred fourteen trillion, five hundred thirty billion, four hundred twenty-six million, seven hundred nineteen thousand, six hundred eleven".