Search a number
-
+
189150631921 is a prime number
BaseRepresentation
bin1011000000101001000…
…0011001011111110001
3200002020020021200102001
42300022100121133301
511044340030210141
6222521122254001
716444220562166
oct2601220313761
9602206250361
10189150631921
11732446673a9
12307aa1b7301
1314ab5685254
14922522206d
154dc0c3ba31
hex2c0a4197f1

189150631921 has 2 divisors, whose sum is σ = 189150631922. Its totient is φ = 189150631920.

The previous prime is 189150631919. The next prime is 189150631949. The reversal of 189150631921 is 129136051981.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 121427856225 + 67722775696 = 348465^2 + 260236^2 .

It is a cyclic number.

It is not a de Polignac number, because 189150631921 - 21 = 189150631919 is a prime.

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

Together with 189150631919, it forms a pair of twin primes.

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

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

Almost surely, 2189150631921 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 189150631921 in words is "one hundred eighty-nine billion, one hundred fifty million, six hundred thirty-one thousand, nine hundred twenty-one".