Properties of the Number 11168

Eleven Thousand One Hundred Sixty-Eight

Basics

Value: 11167 → 11168 → 11169

Parity: even

Prime: No

Previous Prime: 11161

Next Prime: 11171

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ⁵ × 349

Divisors: 1, 2, 4, 8, 16, 32, 349, 698, 1396, 2792

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 10101110100000

Octal: 25640

Duodecimal: 6568

Hexadecimal: 2ba0

Square: 124724224

Square Root: 105.67875850898325

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

Number of subsets of integers 1 through n (including the empty set) containing no pair of integers that share a common factor. A84422

T(n,k) = Number of n X k 0..1 arrays with the number of 1s horizontally or antidiagonally adjacent to some 0 one less than the number of 0's adjacent to some 1. A285152

Suppose e<f, e<h, g<f and g<h. To avoid fegh means not to have four consecutive letters such that the second and the third letters are less than the first and the fourth letters. A177482

T(n,k)=5X5X5 triangular graph without horizontal edges coloring a rectangular array: number of nXk 0..14 arrays where 0..14 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 3,6 3,7 4,7 4,8 5,8 5,9 6,10 6,11 7,11 7,12 8,12 8,13 9,13 9,14 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223432

Number of Greek-key tours on a 3 X n board; i.e., self-avoiding walks on a 3 X n grid starting in the top left corner. A46994

Rounded sums of the non-integer cube roots of n, as partitioned by the integer roots: round(∑_{j=n³+1..(n+1)³-1} j^1/3). A248575

Let n = a_1a_2...a_k, where the a_i are digits. a(n) = least multiple of n of the type b_1a_1b_2a_2...a_kb_k+1, obtained by inserting single digits b_i in the gaps and both ends; 0 if no such number exists. A110735

Let r₁ = 1. Let r_m+1 = r₁ + 1/(r₂ + 1/(r₃ +...(r_m-1 + 1/r_m)...)), a continued fraction of rational terms. Then a(n) is the sum of the (positive integer) terms in the simple continued fraction of r_n. A138744

a(n) = floor((265/6)*4^n-4 - n² - ((15+(-1)^n-1)/6)* 2^n-3). A185098

G.f. satisfies A(x) = exp( ∑_k>=1 (-1)^k+1 * (3^k + A(x^k)) * x^k/k ). A363543