Search a number
-
+
14716926013 is a prime number
BaseRepresentation
bin11011011010011001…
…00111100000111101
31101222122111022011211
431231030213200331
5220120013113023
610432202444421
71030461543556
oct155514474075
941878438154
1014716926013
116272359379
122a28803711
131506cc645a
149d87b932d
155b204aa0d
hex36d32783d

14716926013 has 2 divisors, whose sum is σ = 14716926014. Its totient is φ = 14716926012.

The previous prime is 14716926011. The next prime is 14716926017. The reversal of 14716926013 is 31062961741.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 8946700569 + 5770225444 = 94587^2 + 75962^2 .

It is a cyclic number.

It is not a de Polignac number, because 14716926013 - 21 = 14716926011 is a prime.

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

Together with 14716926011, it forms a pair of twin primes.

It is a congruent number.

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

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

Almost surely, 214716926013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 54432, while the sum is 40.

The spelling of 14716926013 in words is "fourteen billion, seven hundred sixteen million, nine hundred twenty-six thousand, thirteen".