Search a number
-
+
1049974141 is a prime number
BaseRepresentation
bin111110100101010…
…101010101111101
32201011201012202011
4332211111111331
54122243133031
6252104331221
735006430046
oct7645252575
92634635664
101049974141
11499757127
12253773b11
131396b6898
149d6398cd
15622a36b1
hex3e95557d

1049974141 has 2 divisors, whose sum is σ = 1049974142. Its totient is φ = 1049974140.

The previous prime is 1049974103. The next prime is 1049974147. The reversal of 1049974141 is 1414799401.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 811395225 + 238578916 = 28485^2 + 15446^2 .

It is a cyclic number.

It is not a de Polignac number, because 1049974141 - 219 = 1049449853 is a prime.

It is a super-2 number, since 2×10499741412 = 2204891393537375762, which contains 22 as substring.

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

It is a congruent number.

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

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

Almost surely, 21049974141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 36288, while the sum is 40.

The square root of 1049974141 is about 32403.3044765499. The cubic root of 1049974141 is about 1016.3880129389.

The spelling of 1049974141 in words is "one billion, forty-nine million, nine hundred seventy-four thousand, one hundred forty-one".