Search a number
-
+
10051957 is a prime number
BaseRepresentation
bin100110010110…
…000101110101
3200220200200201
4212112011311
510033130312
6555240501
7151303666
oct46260565
920820621
1010051957
115746203
123449131
13210c406
14149936d
15d38557
hex996175

10051957 has 2 divisors, whose sum is σ = 10051958. Its totient is φ = 10051956.

The previous prime is 10051949. The next prime is 10051961. The reversal of 10051957 is 75915001.

10051957 is digitally balanced in base 2, 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., 8346321 + 1705636 = 2889^2 + 1306^2 .

It is a cyclic number.

It is not a de Polignac number, because 10051957 - 23 = 10051949 is a prime.

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 210051957 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 10051957 is about 3170.4821399907. The cubic root of 10051957 is about 215.8159511882.

Adding to 10051957 its reverse (75915001), we get a palindrome (85966958).

It can be divided in two parts, 100519 and 57, that added together give a triangular number (100576 = T448).

The spelling of 10051957 in words is "ten million, fifty-one thousand, nine hundred fifty-seven".