Search a number
-
+
14416938104269 is a prime number
BaseRepresentation
bin1101000111001011010001…
…1110010111010111001101
31220001020122012112011200111
43101302310132113113031
53342201342123314034
650355014441400021
73015406110641551
oct321626436272715
956036565464614
1014416938104269
114659209790468
12174a123499011
138076857c389c
1437bad7ddb861
151a003e844364
hexd1cb47975cd

14416938104269 has 2 divisors, whose sum is σ = 14416938104270. Its totient is φ = 14416938104268.

The previous prime is 14416938104201. The next prime is 14416938104273. The reversal of 14416938104269 is 96240183961441.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9984810015625 + 4432128088644 = 3159875^2 + 2105262^2 .

It is a cyclic number.

It is not a de Polignac number, because 14416938104269 - 27 = 14416938104141 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 214416938104269 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 14416938104269 in words is "fourteen trillion, four hundred sixteen billion, nine hundred thirty-eight million, one hundred four thousand, two hundred sixty-nine".