Search a number
-
+
189150631949 is a prime number
BaseRepresentation
bin1011000000101001000…
…0011001100000001101
3200002020020021200110002
42300022100121200031
511044340030210244
6222521122254045
716444220562236
oct2601220314015
9602206250402
10189150631949
1173244667424
12307aa1b7325
1314ab5685276
14922522208d
154dc0c3ba4e
hex2c0a41980d

189150631949 has 2 divisors, whose sum is σ = 189150631950. Its totient is φ = 189150631948.

The previous prime is 189150631921. The next prime is 189150631951. The reversal of 189150631949 is 949136051981.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 180756774025 + 8393857924 = 425155^2 + 91618^2 .

It is a cyclic number.

It is not a de Polignac number, because 189150631949 - 216 = 189150566413 is a prime.

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

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 189150631894 and 189150631903.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 2189150631949 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2099520, while the sum is 56.

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