Search a number
-
+
10009275733 is a prime number
BaseRepresentation
bin10010101001001100…
…10110110101010101
3221211120012220001001
421110212112311111
5130444333310413
64333113303301
7503016303622
oct112446266525
927746186031
1010009275733
114276a80006
121b34104b31
13c368b7482
146ad499349
153d8ae14dd
hex254996d55

10009275733 has 2 divisors, whose sum is σ = 10009275734. Its totient is φ = 10009275732.

The previous prime is 10009275709. The next prime is 10009275737. The reversal of 10009275733 is 33757290001.

10009275733 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7181376049 + 2827899684 = 84743^2 + 53178^2 .

It is a cyclic number.

It is not a de Polignac number, because 10009275733 - 233 = 1419341141 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 210009275733 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 39690, while the sum is 37.

The spelling of 10009275733 in words is "ten billion, nine million, two hundred seventy-five thousand, seven hundred thirty-three".