Search a number
-
+
899635141 is a prime number
BaseRepresentation
bin110101100111110…
…101011111000101
32022200211012102001
4311213311133011
53320301311031
6225134145301
731202525656
oct6547653705
92280735361
10899635141
11421903219
12211352231
131144c95b2
14876a352d
1553ea8861
hex359f57c5

899635141 has 2 divisors, whose sum is σ = 899635142. Its totient is φ = 899635140.

The previous prime is 899635081. The next prime is 899635147. The reversal of 899635141 is 141536998.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 584430625 + 315204516 = 24175^2 + 17754^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-899635141 is a prime.

It is equal to p45991585 and since 899635141 and 45991585 have the same sum of digits, it is a Honaker prime.

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

It is a congruent number.

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

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

Almost surely, 2899635141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 233280, while the sum is 46.

The square root of 899635141 is about 29993.9184002357. The cubic root of 899635141 is about 965.3588975297.

The spelling of 899635141 in words is "eight hundred ninety-nine million, six hundred thirty-five thousand, one hundred forty-one".