Search a number
-
+
330221031201157 is a prime number
BaseRepresentation
bin100101100010101011001001…
…1010000110001100110000101
31121022012211012102211202010211
41023011112103100301212011
5321240320132441414112
63130153240353115421
7126361452664321465
oct11305262320614605
91538184172752124
10330221031201157
1196244a532a5458
123105306b258b71
131123492c080955
145b78ad70d9ba5
152829c1811e0a7
hex12c5593431985

330221031201157 has 2 divisors, whose sum is σ = 330221031201158. Its totient is φ = 330221031201156.

The previous prime is 330221031201073. The next prime is 330221031201181. The reversal of 330221031201157 is 751102130122033.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 241746803107681 + 88474228093476 = 15548209^2 + 9406074^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-330221031201157 is a prime.

It is a congruent number.

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

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

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

Almost surely, 2330221031201157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 7560, while the sum is 31.

The spelling of 330221031201157 in words is "three hundred thirty trillion, two hundred twenty-one billion, thirty-one million, two hundred one thousand, one hundred fifty-seven".