Search a number
-
+
11368435 = 5132937163
BaseRepresentation
bin101011010111…
…011111110011
3210101120120011
4223113133303
510402242220
61043355351
7165426061
oct53273763
923346504
1011368435
116465301
123982b57
1324806b0
14171d031
15ee865a
hexad77f3

11368435 has 32 divisors (see below), whose sum is σ = 15704640. Its totient is φ = 7838208.

The previous prime is 11368411. The next prime is 11368457. The reversal of 11368435 is 53486311.

It is a 9-Lehmer number, since φ(11368435) divides (11368435-1)9.

It is a cyclic number.

It is not a de Polignac number, because 11368435 - 213 = 11360243 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 11368397 and 11368406.

It is an unprimeable number.

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 69664 + ... + 69826.

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

Almost surely, 211368435 is an apocalyptic number.

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

11368435 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 247.

The product of its digits is 8640, while the sum is 31.

The square root of 11368435 is about 3371.7109899871. The cubic root of 11368435 is about 224.8537980246.

The spelling of 11368435 in words is "eleven million, three hundred sixty-eight thousand, four hundred thirty-five".

Divisors: 1 5 13 29 37 65 145 163 185 377 481 815 1073 1885 2119 2405 4727 5365 6031 10595 13949 23635 30155 61451 69745 78403 174899 307255 392015 874495 2273687 11368435