Search a number
-
+
1049029231 is a prime number
BaseRepresentation
bin111110100001101…
…110101001101111
32201002221012120111
4332201232221233
54122022413411
6252032200451
734665413155
oct7641565157
92632835514
101049029231
11499171208
12253399127
13139445773
149d4713d5
1562168721
hex3e86ea6f

1049029231 has 2 divisors, whose sum is σ = 1049029232. Its totient is φ = 1049029230.

The previous prime is 1049029213. The next prime is 1049029277. The reversal of 1049029231 is 1329209401.

Together with previous prime (1049029213) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 1049029231 - 219 = 1048504943 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 21049029231 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 3888, while the sum is 31.

The square root of 1049029231 is about 32388.7207373184. The cubic root of 1049029231 is about 1016.0830265581.

The spelling of 1049029231 in words is "one billion, forty-nine million, twenty-nine thousand, two hundred thirty-one".