Search a number
-
+
10572161 is a prime number
BaseRepresentation
bin101000010101…
…000110000001
3201220010021112
4220111012001
510201302121
61014333105
7155601425
oct50250601
921803245
1010572161
115a71026
12365a195
132262122
141592b85
15ddc75b
hexa15181

10572161 has 2 divisors, whose sum is σ = 10572162. Its totient is φ = 10572160.

The previous prime is 10572143. The next prime is 10572173. The reversal of 10572161 is 16127501.

10572161 is digitally balanced in base 3, because in such base 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., 8151025 + 2421136 = 2855^2 + 1556^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×105721612 = 223541176419842, which contains 22 as substring.

It is a Sophie Germain prime.

It is a Chen prime.

It is a Curzon number.

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

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

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

Almost surely, 210572161 is an apocalyptic number.

It is an amenable number.

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

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

10572161 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 420, while the sum is 23.

The square root of 10572161 is about 3251.4859679845. The cubic root of 10572161 is about 219.4764478857.

Adding to 10572161 its reverse (16127501), we get a palindrome (26699662).

The spelling of 10572161 in words is "ten million, five hundred seventy-two thousand, one hundred sixty-one".