Search a number
-
+
913051141 is a prime number
BaseRepresentation
bin110110011011000…
…000111000000101
32100122001210200221
4312123000320011
53332220114031
6230333504341
731424543452
oct6633007005
92318053627
10913051141
11429436922
122159420b1
13117215c62
1489396829
1555258a11
hex366c0e05

913051141 has 2 divisors, whose sum is σ = 913051142. Its totient is φ = 913051140.

The previous prime is 913051103. The next prime is 913051189. The reversal of 913051141 is 141150319.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 685916100 + 227135041 = 26190^2 + 15071^2 .

It is a cyclic number.

It is not a de Polignac number, because 913051141 - 29 = 913050629 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (913054141) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 456525570 + 456525571.

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

Almost surely, 2913051141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 540, while the sum is 25.

The square root of 913051141 is about 30216.7361076606. The cubic root of 913051141 is about 970.1339457923.

The spelling of 913051141 in words is "nine hundred thirteen million, fifty-one thousand, one hundred forty-one".