Search a number
-
+
153090737609 is a prime number
BaseRepresentation
bin1000111010010011101…
…0110100010111001001
3112122011011020020210212
42032210322310113021
510002012212100414
6154155013450505
714026505541035
oct2164472642711
9478134206725
10153090737609
1159a1a804057
1225805940a35
13115899b3594
1475a40571c5
153eb00e883e
hex23a4eb45c9

153090737609 has 2 divisors, whose sum is σ = 153090737610. Its totient is φ = 153090737608.

The previous prime is 153090737567. The next prime is 153090737651. The reversal of 153090737609 is 906737090351.

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

It is a balanced prime because it is at equal distance from previous prime (153090737567) and next prime (153090737651).

It can be written as a sum of positive squares in only one way, i.e., 113191873600 + 39898864009 = 336440^2 + 199747^2 .

It is a cyclic number.

It is not a de Polignac number, because 153090737609 - 28 = 153090737353 is a prime.

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

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

Almost surely, 2153090737609 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1071630, while the sum is 50.

The spelling of 153090737609 in words is "one hundred fifty-three billion, ninety million, seven hundred thirty-seven thousand, six hundred nine".