Search a number
-
+
149665480709 is a prime number
BaseRepresentation
bin1000101101100011000…
…0100000000000000101
3112022022110000011200012
42023120300200000011
54423003330340314
6152431054400005
713545564411233
oct2133060400005
9468273004605
10149665480709
1158522297928
122500a800005
1311162186654
14735b193953
153d5e55293e
hex22d8c20005

149665480709 has 2 divisors, whose sum is σ = 149665480710. Its totient is φ = 149665480708.

The previous prime is 149665480693. The next prime is 149665480711. The reversal of 149665480709 is 907084566941.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 144668404609 + 4997076100 = 380353^2 + 70690^2 .

It is a cyclic number.

It is not a de Polignac number, because 149665480709 - 24 = 149665480693 is a prime.

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

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

It is a Chen prime.

It is a congruent number.

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

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

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

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

Almost surely, 2149665480709 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 13063680, while the sum is 59.

The spelling of 149665480709 in words is "one hundred forty-nine billion, six hundred sixty-five million, four hundred eighty thousand, seven hundred nine".