Search a number
-
+
11065707 = 33409841
BaseRepresentation
bin101010001101…
…100101101011
3202211012022000
4222031211223
510313100312
61033102043
7163025352
oct52154553
922735260
1011065707
116278914
123857923
1323a5973
141680999
15e88adc
hexa8d96b

11065707 has 8 divisors (see below), whose sum is σ = 16393680. Its totient is φ = 7377120.

The previous prime is 11065699. The next prime is 11065739. The reversal of 11065707 is 70756011.

11065707 is a `hidden beast` number, since 1 + 1 + 0 + 657 + 0 + 7 = 666.

It is not a de Polignac number, because 11065707 - 23 = 11065699 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 409841 = 11065707 / (1 + 1 + 0 + 6 + 5 + 7 + 0 + 7).

It is not an unprimeable number, because it can be changed into a prime (11065757) 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 in 7 ways as a sum of consecutive naturals, for example, 204894 + ... + 204947.

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

Almost surely, 211065707 is an apocalyptic number.

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

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

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

The sum of its prime factors is 409850 (or 409844 counting only the distinct ones).

The product of its (nonzero) digits is 1470, while the sum is 27.

The square root of 11065707 is about 3326.5157447395. The cubic root of 11065707 is about 222.8399516536.

The spelling of 11065707 in words is "eleven million, sixty-five thousand, seven hundred seven".

Divisors: 1 3 9 27 409841 1229523 3688569 11065707