Properties of the Number 11302

Eleven Thousand Three Hundred Two

Basics

Value: 11301 → 11302 → 11303

Parity: even

Prime: No

Previous Prime: 11299

Next Prime: 11311

Digit Sum: 7

Digital Root: 7

Palindrome: No

Factorization: 2 × 5651

Divisors: 1, 2, 5651, 11302

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10110000100110

Octal: 26046

Duodecimal: 665A

Hexadecimal: 2c26

Square: 127735204

Square Root: 106.310864919819

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 n-node graphs without isolated nodes. A2494

Regular triangle where T(n,k) is the number of unlabeled k-uniform hypergraphs spanning n vertices. A301922

Coefficients of monic primitive irreducible polynomials over GF(4) listed in lexicographic order. A58952

Greatest number having exactly n representations as ab+ac+bc with 1 <= a <= b <= c. A94380

Expansion of ∏_m>=1 (1-m·q^m)^-10. A22734

Expansion of g.f. -(1+x²+x⁴)/((x³+x²+x-1)*(x-1)²). A104187

Triangle read by rows where T(n,k) is the number of unlabeled simple graphs covering n vertices with vertex-connectivity >= k. A327365

a(n) is the smallest possible side·in a family of triangles with integer sides x, y < x, x-y < z < x+y, such that exactly n pairs of triangles with equal area exist in this family. A375748

Number of nondecreasing arrangements of n+3 numbers in 0..3 with each number being the sum mod 4 of three others. A183898

Triangular array read by rows: T(n,k) is the number of unlabeled simple graphs with n nodes that have exactly k isolated nodes, (n>=0, 0<=k<=n). A217653