Search a number
-
+
14929925641 is a prime number
BaseRepresentation
bin11011110011110010…
…01001011000001001
31102112111021210201221
431321321021120021
5221034030110031
610505252042041
71035656163001
oct157171113011
942474253657
1014929925641
116371610124
122a88003321
13153c182737
14a18bc3001
155c5ac1a11
hex379e49609

14929925641 has 2 divisors, whose sum is σ = 14929925642. Its totient is φ = 14929925640.

The previous prime is 14929925629. The next prime is 14929925693. The reversal of 14929925641 is 14652992941.

14929925641 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is an a-pointer prime, because the next prime (14929925693) can be obtained adding 14929925641 to its sum of digits (52).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9642454416 + 5287471225 = 98196^2 + 72715^2 .

It is a cyclic number.

It is not a de Polignac number, because 14929925641 - 27 = 14929925513 is a prime.

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

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

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

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

Almost surely, 214929925641 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 1399680, while the sum is 52.

The spelling of 14929925641 in words is "fourteen billion, nine hundred twenty-nine million, nine hundred twenty-five thousand, six hundred forty-one".