Search a number
-
+
104999514397 is a prime number
BaseRepresentation
bin110000111001001110…
…1010111000100011101
3101001000121002222200121
41201302131113010131
53210014333430042
6120122555554541
710404662101141
oct1416235270435
9331017088617
10104999514397
1140591541288
121842415ba51
139b9452b29b
145121037221
152ae80e7367
hex187275711d

104999514397 has 2 divisors, whose sum is σ = 104999514398. Its totient is φ = 104999514396.

The previous prime is 104999514229. The next prime is 104999514407. The reversal of 104999514397 is 793415999401.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 97900777881 + 7098736516 = 312891^2 + 84254^2 .

It is a cyclic number.

It is not a de Polignac number, because 104999514397 - 211 = 104999512349 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2104999514397 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 11022480, while the sum is 61.

The spelling of 104999514397 in words is "one hundred four billion, nine hundred ninety-nine million, five hundred fourteen thousand, three hundred ninety-seven".