Search a number
-
+
10045531109 is a prime number
BaseRepresentation
bin10010101101100001…
…01010001111100101
3221221002102212001202
421112300222033211
5131033123443414
64340450332245
7503636414465
oct112660521745
927832385052
1010045531109
114295493229
121b4428a085
13c4126c763
146b4215ba5
153dbda39de
hex256c2a3e5

10045531109 has 2 divisors, whose sum is σ = 10045531110. Its totient is φ = 10045531108.

The previous prime is 10045531091. The next prime is 10045531123. The reversal of 10045531109 is 90113554001.

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

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5722468609 + 4323062500 = 75647^2 + 65750^2 .

It is a cyclic number.

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

It is a congruent number.

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

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

Almost surely, 210045531109 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2700, while the sum is 29.

The spelling of 10045531109 in words is "ten billion, forty-five million, five hundred thirty-one thousand, one hundred nine".