Properties of the Number 11266

Eleven Thousand Two Hundred Sixty-Six

Basics

Value: 11265 → 11266 → 11267

Parity: even

Prime: No

Previous Prime: 11261

Next Prime: 11273

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 43 × 131

Divisors: 1, 2, 43, 86, 131, 262, 5633, 11266

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10110000000010

Octal: 26002

Duodecimal: 662A

Hexadecimal: 2c02

Square: 126922756

Square Root: 106.1414151026827

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

Numbers k such that 13^k == 15 (mod k). A116639

Number of 12-regular partitions of n (no part is a multiple of 12). A328546

Expansion of η(q⁶) * η(q¹⁰) / (η(q) * η(q¹⁵)) in powers of q. A94023

Number of integer compositions of n whose parts all have the same number of prime factors, counted with multiplicity. A358911

(1/12)*Number of non-degenerate obtuse triangles that can be formed from the points of an (n+1)X(n+1)X(n+1) lattice cube. A103428

Square array T(n,k) = number of plane partitions of n with parts colored in (at most) k colors; n >= 0, k >= 0; read by antidiagonals. A306100

Number of plane partitions of n where parts are colored in 2 colors. A306099

Square array T(n,k) = number of plane partitions of n with parts colored in (at most) k colors; n, k >= 1; read by antidiagonals. A306101

Number of partitions of n² into squares not greater than n. A93115

Expansion of q * (χ(-q³) * χ(-q⁵)) / (χ(-q) * χ(-q¹⁵))² in powers of q where χ() is a Ramanujan θ function. A123630