Search a number
-
+
14390641511 is a prime number
BaseRepresentation
bin11010110011011111…
…11100001101100111
31101010220112022222122
431121233330031213
5213433001012021
610335545220155
71016420302031
oct153157741547
941126468878
1014390641511
116115161a64
12295749165b
1314845248bc
149a7322c51
15593598bab
hex359bfc367

14390641511 has 2 divisors, whose sum is σ = 14390641512. Its totient is φ = 14390641510.

The previous prime is 14390641469. The next prime is 14390641519. The reversal of 14390641511 is 11514609341.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 14390641511 - 210 = 14390640487 is a prime.

It is a congruent number.

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

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

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

Almost surely, 214390641511 is an apocalyptic number.

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

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

14390641511 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 12960, while the sum is 35.

The spelling of 14390641511 in words is "fourteen billion, three hundred ninety million, six hundred forty-one thousand, five hundred eleven".