Search a number
-
+
11509047 = 341112917
BaseRepresentation
bin101011111001…
…110100110111
3210122201110000
4223321310313
510421242142
61050402343
7166553034
oct53716467
923581400
1011509047
116550a10
123a303b3
1324cc6b4
14175838b
15102514c
hexaf9d37

11509047 has 20 divisors (see below), whose sum is σ = 18756936. Its totient is φ = 6974640.

The previous prime is 11509037. The next prime is 11509049. The reversal of 11509047 is 74090511.

It is not a de Polignac number, because 11509047 - 27 = 11508919 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (27).

It is a self number, because there is not a number n which added to its sum of digits gives 11509047.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11509049) by changing a digit.

It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 5568 + ... + 7349.

Almost surely, 211509047 is an apocalyptic number.

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

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

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

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

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

The square root of 11509047 is about 3392.4986366983. The cubic root of 11509047 is about 225.7770466816. Note that the first 3 decimals are identical.

Adding to 11509047 its reverse (74090511), we get a palindrome (85599558).

The spelling of 11509047 in words is "eleven million, five hundred nine thousand, forty-seven".

Divisors: 1 3 9 11 27 33 81 99 297 891 12917 38751 116253 142087 348759 426261 1046277 1278783 3836349 11509047