Search a number
-
+
1082706029 is a prime number
BaseRepresentation
bin100000010001000…
…1100100001101101
32210110022011110022
41000202030201231
54204133043104
6255234051525
735554564226
oct10042144155
92713264408
101082706029
11506183079
12262719ba5
13143407172
14a3b1a24d
15650bbbbe
hex4088c86d

1082706029 has 2 divisors, whose sum is σ = 1082706030. Its totient is φ = 1082706028.

The previous prime is 1082706017. The next prime is 1082706041. The reversal of 1082706029 is 9206072801.

It is a happy number.

It is a balanced prime because it is at equal distance from previous prime (1082706017) and next prime (1082706041).

It can be written as a sum of positive squares in only one way, i.e., 917968804 + 164737225 = 30298^2 + 12835^2 .

It is a cyclic number.

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

It is a self number, because there is not a number n which added to its sum of digits gives 1082706029.

It is a congruent number.

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

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

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

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

Almost surely, 21082706029 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12096, while the sum is 35.

The square root of 1082706029 is about 32904.4986134115. The cubic root of 1082706029 is about 1026.8417504549.

The spelling of 1082706029 in words is "one billion, eighty-two million, seven hundred six thousand, twenty-nine".