Search a number
-
+
1198983390233 is a prime number
BaseRepresentation
bin10001011100101000111…
…110101010010000011001
311020121210012202222112212
4101130220332222100121
5124121004221441413
62314445543044505
7152423632443116
oct21345076522031
94217705688485
101198983390233
11422538959132
12174455140735
13890a9ab3575
14420614d590d
15212c5827ca8
hex11728faa419

1198983390233 has 2 divisors, whose sum is σ = 1198983390234. Its totient is φ = 1198983390232.

The previous prime is 1198983390211. The next prime is 1198983390277. The reversal of 1198983390233 is 3320933898911.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 872380284169 + 326603106064 = 934013^2 + 571492^2 .

It is a cyclic number.

It is not a de Polignac number, because 1198983390233 - 26 = 1198983390169 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

Almost surely, 21198983390233 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 7558272, while the sum is 59.

The spelling of 1198983390233 in words is "one trillion, one hundred ninety-eight billion, nine hundred eighty-three million, three hundred ninety thousand, two hundred thirty-three".