Search a number
-
+
190995656513 is a prime number
BaseRepresentation
bin1011000111100000111…
…0100110111101000001
3200020222211000122100012
42301320032212331001
511112124342002023
6223424151434305
716541023202504
oct2617016467501
9606884018305
10190995656513
1174001083712
1231024085995
131501a9aab8c
14935c29913b
154e7cbda978
hex2c783a6f41

190995656513 has 2 divisors, whose sum is σ = 190995656514. Its totient is φ = 190995656512.

The previous prime is 190995656507. The next prime is 190995656519. The reversal of 190995656513 is 315656599091.

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

It is a balanced prime because it is at equal distance from previous prime (190995656507) and next prime (190995656519).

It can be written as a sum of positive squares in only one way, i.e., 189114526129 + 1881130384 = 434873^2 + 43372^2 .

It is a cyclic number.

It is not a de Polignac number, because 190995656513 - 24 = 190995656497 is a prime.

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

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

Almost surely, 2190995656513 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 190995656513 in words is "one hundred ninety billion, nine hundred ninety-five million, six hundred fifty-six thousand, five hundred thirteen".