Search a number
BaseRepresentation
bin100010000100110011
321002110022
4202010303
513431241
62554055
71120625
oct420463
9232408
10139571
1195953
126892b
134b6b3
1438c15
152b54b
hex22133

139571 has 2 divisors, whose sum is σ = 139572. Its totient is φ = 139570.

The previous prime is 139547. The next prime is 139589. The reversal of 139571 is 175931.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 139571 - 210 = 138547 is a prime.

It is a Sophie Germain prime.

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

It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 139571.

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

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

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

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

2139571 is an apocalyptic number.

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

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

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

The product of its digits is 945, while the sum is 26.

The square root of 139571 is about 373.5920234695. The cubic root of 139571 is about 51.8718491336.

The spelling of 139571 in words is "one hundred thirty-nine thousand, five hundred seventy-one".