Search a number
-
+
190980433951 is a prime number
BaseRepresentation
bin1011000111011101010…
…0100010100000011111
3200020221202101020220121
42301313110202200133
511112111442341301
6223422445255411
716540446622036
oct2616724424037
9606852336817
10190980433951
1173aa352678a
123101ab64567
13150177ab148
14935a25571d
154e7b6d03a1
hex2c7752281f

190980433951 has 2 divisors, whose sum is σ = 190980433952. Its totient is φ = 190980433950.

The previous prime is 190980433843. The next prime is 190980433961. The reversal of 190980433951 is 159334089091.

It is a happy number.

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

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 190980433951 - 219 = 190979909663 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2190980433951 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1049760, while the sum is 52.

The spelling of 190980433951 in words is "one hundred ninety billion, nine hundred eighty million, four hundred thirty-three thousand, nine hundred fifty-one".