Search a number
-
+
11016913 = 17961547
BaseRepresentation
bin101010000001…
…101011010001
3202201201100211
4222001223101
510310020123
61032044121
7162433165
oct52015321
922651324
1011016913
116245196
123833641
1323896ab
14166aca5
15e7940d
hexa81ad1

11016913 has 4 divisors (see below), whose sum is σ = 11078640. Its totient is φ = 10955188.

The previous prime is 11016881. The next prime is 11016917. The reversal of 11016913 is 31961011.

It is a happy number.

11016913 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

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 cyclic number.

It is not a de Polignac number, because 11016913 - 25 = 11016881 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (11016917) 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, 30595 + ... + 30952.

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

Almost surely, 211016913 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 61726.

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

The square root of 11016913 is about 3319.1735417119. The cubic root of 11016913 is about 222.5119330384.

Adding to 11016913 its reverse (31961011), we get a palindrome (42977924).

The spelling of 11016913 in words is "eleven million, sixteen thousand, nine hundred thirteen".

Divisors: 1 179 61547 11016913