Search a number
-
+
141572701 is a prime number
BaseRepresentation
bin10000111000000…
…11101001011101
3100212101122020101
420130003221131
5242220311301
622014221101
73336230254
oct1034035135
9325348211
10141572701
1172a06736
123b4b4791
132343b13a
1414b3379b
15c667701
hex8703a5d

141572701 has 2 divisors, whose sum is σ = 141572702. Its totient is φ = 141572700.

The previous prime is 141572687. The next prime is 141572737. The reversal of 141572701 is 107275141.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 122124601 + 19448100 = 11051^2 + 4410^2 .

It is a cyclic number.

It is not a de Polignac number, because 141572701 - 227 = 7354973 is a prime.

It is a Chen prime.

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

It is a congruent number.

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

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

Almost surely, 2141572701 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1960, while the sum is 28.

The square root of 141572701 is about 11898.4327119163. The cubic root of 141572701 is about 521.1865176577.

The spelling of 141572701 in words is "one hundred forty-one million, five hundred seventy-two thousand, seven hundred one".