Search a number
-
+
149367605657 is a prime number
BaseRepresentation
bin1000101100011100000…
…0001100100110011001
3112021112200111112220212
42023013000030212121
54421401101340112
6152341334100505
713535316461654
oct2130700144631
9467480445825
10149367605657
115838a1349a6
1224b46aaa735
1311115550b1a
14732d7b489b
153d43313522
hex22c700c999

149367605657 has 2 divisors, whose sum is σ = 149367605658. Its totient is φ = 149367605656.

The previous prime is 149367605623. The next prime is 149367605671. The reversal of 149367605657 is 756506763941.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 147109835401 + 2257770256 = 383549^2 + 47516^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 149367605657 - 26 = 149367605593 is a prime.

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

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

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

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

Almost surely, 2149367605657 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 149367605657 in words is "one hundred forty-nine billion, three hundred sixty-seven million, six hundred five thousand, six hundred fifty-seven".