Search a number
-
+
140925709 is a prime number
BaseRepresentation
bin10000110011001…
…01101100001101
3100211011202201201
420121211230031
5242034110314
621552305501
73330564061
oct1031455415
9324152651
10140925709
1172604631
123b242291
13232727c2
1414a05aa1
15c58ab74
hex8665b0d

140925709 has 2 divisors, whose sum is σ = 140925710. Its totient is φ = 140925708.

The previous prime is 140925683. The next prime is 140925727. The reversal of 140925709 is 907529041.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 74046025 + 66879684 = 8605^2 + 8178^2 .

It is a cyclic number.

It is not a de Polignac number, because 140925709 - 27 = 140925581 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2140925709 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 140925709 is about 11871.2134594573. The cubic root of 140925709 is about 520.3913584913.

The spelling of 140925709 in words is "one hundred forty million, nine hundred twenty-five thousand, seven hundred nine".