Search a number
-
+
189167494871 is a prime number
BaseRepresentation
bin1011000000101101000…
…0101110011011010111
3200002021102000102000202
42300023100232123113
511044403334313441
6222522523531115
716444514114255
oct2601320563327
9602242012022
10189167494871
1173253134823
12307b3989a9b
1314ab900a824
1492275715d5
154dc246d19b
hex2c0b42e6d7

189167494871 has 2 divisors, whose sum is σ = 189167494872. Its totient is φ = 189167494870.

The previous prime is 189167494837. The next prime is 189167494907. The reversal of 189167494871 is 178494761981.

189167494871 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 189167494871 - 26 = 189167494807 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 2189167494871 is an apocalyptic number.

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

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

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

The product of its digits is 24385536, while the sum is 65.

The spelling of 189167494871 in words is "one hundred eighty-nine billion, one hundred sixty-seven million, four hundred ninety-four thousand, eight hundred seventy-one".