Search a number
-
+
10936901 is a prime number
BaseRepresentation
bin101001101110…
…001001000101
3202120122121102
4221232021011
510244440101
61030225445
7161651003
oct51561105
922518542
1010936901
1161a0068
1237b5285
13235c151
141649a73
15e6086b
hexa6e245

10936901 has 2 divisors, whose sum is σ = 10936902. Its totient is φ = 10936900.

The previous prime is 10936843. The next prime is 10936907. The reversal of 10936901 is 10963901.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10660225 + 276676 = 3265^2 + 526^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-10936901 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 (10936907) by changing a digit.

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

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

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

Almost surely, 210936901 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1458, while the sum is 29.

The square root of 10936901 is about 3307.0985773031. The cubic root of 10936901 is about 221.9719481369.

Subtracting 10936901 from its reverse (10963901), we obtain a cube (27000 = 303).

The spelling of 10936901 in words is "ten million, nine hundred thirty-six thousand, nine hundred one".