Search a number
-
+
10915057 is a prime number
BaseRepresentation
bin101001101000…
…110011110001
3202112112122101
4221220303301
510243240212
61025540401
7161530216
oct51506361
922475571
1010915057
11618570a
1237a4701
13235221a
141641b0d
15e59157
hexa68cf1

10915057 has 2 divisors, whose sum is σ = 10915058. Its totient is φ = 10915056.

The previous prime is 10915039. The next prime is 10915141. The reversal of 10915057 is 75051901.

10915057 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10751841 + 163216 = 3279^2 + 404^2 .

It is a cyclic number.

It is not a de Polignac number, because 10915057 - 27 = 10914929 is a prime.

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

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

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

Almost surely, 210915057 is an apocalyptic number.

It is an amenable number.

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

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

10915057 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 10915057 is about 3303.7943337926. The cubic root of 10915057 is about 221.8240699607.

Adding to 10915057 its reverse (75051901), we get a palindrome (85966958).

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