Search a number
-
+
14206861101539 is a prime number
BaseRepresentation
bin1100111010111100101011…
…1010001100100111100011
31212022011101120120201011202
43032233022322030213203
53330231122420222124
650114313014231415
72664261155612051
oct316571272144743
955264346521152
1014206861101539
1145881067a0a37
12171547505556b
137c0916866202
143718898711d1
151998468a15ae
hexcebcae8c9e3

14206861101539 has 2 divisors, whose sum is σ = 14206861101540. Its totient is φ = 14206861101538.

The previous prime is 14206861101533. The next prime is 14206861101679. The reversal of 14206861101539 is 93510116860241.

It is a weak prime.

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-14206861101539 is a prime.

It is a super-3 number, since 3×142068611015393 (a number of 40 digits) contains 333 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 14206861101493 and 14206861101502.

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

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

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

Almost surely, 214206861101539 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 311040, while the sum is 47.

The spelling of 14206861101539 in words is "fourteen trillion, two hundred six billion, eight hundred sixty-one million, one hundred one thousand, five hundred thirty-nine".