Search a number
-
+
1530320601137 is a prime number
BaseRepresentation
bin10110010001001110001…
…101110100000000110001
312102022000200012021011212
4112101032031310000301
5200033044033214022
63131004121245505
7215363525325416
oct26211615640061
95368020167155
101530320601137
115400070a1839
12208705333895
13b1402040403
14540d44cc10d
1529c192013e2
hex1644e374031

1530320601137 has 2 divisors, whose sum is σ = 1530320601138. Its totient is φ = 1530320601136.

The previous prime is 1530320601101. The next prime is 1530320601157. The reversal of 1530320601137 is 7311060230351.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1166851483681 + 363469117456 = 1080209^2 + 602884^2 .

It is a cyclic number.

It is not a de Polignac number, because 1530320601137 - 210 = 1530320600113 is a prime.

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

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

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

Almost surely, 21530320601137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 11340, while the sum is 32.

Adding to 1530320601137 its reverse (7311060230351), we get a palindrome (8841380831488).

The spelling of 1530320601137 in words is "one trillion, five hundred thirty billion, three hundred twenty million, six hundred one thousand, one hundred thirty-seven".