Properties of the Number 11088

Eleven Thousand Eighty-Eight

Basics

Value: 11087 → 11088 → 11089

Parity: even

Prime: No

Previous Prime: 11087

Next Prime: 11093

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ⁴ × 3 ² × 7 × 11

Divisors: 1, 2, 3, 4, 6, 7, 8, 9, 11, 12

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 10101101010000

Octal: 25520

Duodecimal: 6500

Hexadecimal: 2b50

Square: 122943744

Square Root: 105.29957264870546

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

Triangle T(n,k) of rencontres numbers (number of permutations of n elements with k fixed points). A8290

Triangle read by rows: T(n,k) = number of partial derangements, that is, the number of permutations of n distinct, ordered items in which exactly k of the items are in their natural ordered positions, for n >= 0, k = n, n-1, ..., 1, 0. A98825

Multiples of 11 containing an 11 in their decimal representation. A121031

Triangle read by rows: T(n,k) = number of labeled graphs on n nodes with k connected components, 1<=k<=n. A143543

a(n+1) = a(n)/n if n∣a(n) else a(n)*n, a(1) = 1. A8336

Triangle of rencontres numbers. A8291

G.f.: 12th root of Eisenstein series E₆ (cf. A013973). A109817

Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n, having k ddu's [here u = (1,1) and d = (1,-1)]. A91894

Numbers that can be expressed as the difference of the squares of primes in exactly four distinct ways. A92000

Number of ways of writing n as a sum of 7 squares. A8451