Search a number
-
+
11006913 = 33668971
BaseRepresentation
bin101001111111…
…001111000001
3202201012122110
4221333033001
510304210123
61031525533
7162362061
oct51771701
922635573
1011006913
116238725
1238298a9
132384c88
1416673a1
15e76493
hexa7f3c1

11006913 has 4 divisors (see below), whose sum is σ = 14675888. Its totient is φ = 7337940.

The previous prime is 11006887. The next prime is 11006923. The reversal of 11006913 is 31960011.

It is a happy number.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a de Polignac number, because none of the positive numbers 2k-11006913 is a prime.

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1834483 + ... + 1834488.

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

Almost surely, 211006913 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3668974.

The product of its (nonzero) digits is 162, while the sum is 21.

The square root of 11006913 is about 3317.6668006296. Note that the first 3 decimals coincide. The cubic root of 11006913 is about 222.4445883139. Note that the first 3 decimals are identical.

Adding to 11006913 its reverse (31960011), we get a palindrome (42966924).

The spelling of 11006913 in words is "eleven million, six thousand, nine hundred thirteen".

Divisors: 1 3 3668971 11006913