[go: up one dir, main page]

Search a number
-
+
11026513 = 71155303
BaseRepresentation
bin101010000100…
…000001010001
3202202012112101
4222010001101
510310322023
61032200401
7162503161
oct52040121
922665471
1011026513
116251423
123839101
132390b84
1416705a1
15e7c1ad
hexa84051

11026513 has 4 divisors (see below), whose sum is σ = 11181888. Its totient is φ = 10871140.

The previous prime is 11026511. The next prime is 11026531. The reversal of 11026513 is 31562011.

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, and also an emirpimes, since its reverse is a distinct semiprime: 31562011 = 132427847.

It is a cyclic number.

It is not a de Polignac number, because 11026513 - 21 = 11026511 is a prime.

It is a Duffinian number.

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

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

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

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

Almost surely, 211026513 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 155374.

The product of its (nonzero) digits is 180, while the sum is 19.

The square root of 11026513 is about 3320.6193699369. The cubic root of 11026513 is about 222.5765456450.

Adding to 11026513 its reverse (31562011), we get a palindrome (42588524).

The spelling of 11026513 in words is "eleven million, twenty-six thousand, five hundred thirteen".

Divisors: 1 71 155303 11026513