Search a number
-
+
199995151 is a prime number
BaseRepresentation
bin10111110101110…
…10111100001111
3111221022210202211
423322322330033
5402144321101
631502331251
74645634146
oct1372727417
9457283684
10199995151
11a298a354
1256b89b27
1332585035
141c7c075d
1512857c51
hexbebaf0f

199995151 has 2 divisors, whose sum is σ = 199995152. Its totient is φ = 199995150.

The previous prime is 199995137. The next prime is 199995163. The reversal of 199995151 is 151599991.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 199995151 - 25 = 199995119 is a prime.

It is a Chen prime.

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

It is a congruent number.

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

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

Almost surely, 2199995151 is an apocalyptic number.

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

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

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

The product of its digits is 164025, while the sum is 49.

The square root of 199995151 is about 14141.9641846527. The cubic root of 199995151 is about 584.7988214170.

It can be divided in two parts, 1999951 and 51, that added together give a palindrome (2000002).

The spelling of 199995151 in words is "one hundred ninety-nine million, nine hundred ninety-five thousand, one hundred fifty-one".