Search a number
-
+
103661531569 is a prime number
BaseRepresentation
bin110000010001010110…
…1010111000110110001
3100220120100110102022001
41200202231113012301
53144244323002234
6115342122214001
710326554323441
oct1404255270661
9326510412261
10103661531569
113aa65260a52
1218110054301
139a1028497b
14503546a121
152a6a902d14
hex1822b571b1

103661531569 has 2 divisors, whose sum is σ = 103661531570. Its totient is φ = 103661531568.

The previous prime is 103661531537. The next prime is 103661531593. The reversal of 103661531569 is 965135166301.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 88455682225 + 15205849344 = 297415^2 + 123312^2 .

It is a cyclic number.

It is not a de Polignac number, because 103661531569 - 25 = 103661531537 is a prime.

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

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

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

Almost surely, 2103661531569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 437400, while the sum is 46.

The spelling of 103661531569 in words is "one hundred three billion, six hundred sixty-one million, five hundred thirty-one thousand, five hundred sixty-nine".