Search a number
-
+
1323030023069 is a prime number
BaseRepresentation
bin10011010000001010101…
…111000000101110011101
311200110222020101211201112
4103100022233000232131
5133134031141214234
62451442552551405
7164404626433646
oct23201257005635
94613866354645
101323030023069
11470103a58407
121944b40b2565
13979b8468c21
144806c0506cd
1524635bb5ace
hex1340abc0b9d

1323030023069 has 2 divisors, whose sum is σ = 1323030023070. Its totient is φ = 1323030023068.

The previous prime is 1323030023011. The next prime is 1323030023083. The reversal of 1323030023069 is 9603200303231.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1083551919844 + 239478103225 = 1040938^2 + 489365^2 .

It is a cyclic number.

It is not a de Polignac number, because 1323030023069 - 216 = 1323029957533 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21323030023069 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 1323030023069 in words is "one trillion, three hundred twenty-three billion, thirty million, twenty-three thousand, sixty-nine".