Properties of the Number 26766

Twenty-Six Thousand Seven Hundred Sixty-Six

Basics

Value: 26765 → 26766 → 26767

Parity: even

Prime: No

Previous Prime: 26759

Next Prime: 26777

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 1487

Divisors: 1, 2, 3, 6, 9, 18, 1487, 2974, 4461, 8922

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110100010001110

Octal: 64216

Duodecimal: 135A6

Hexadecimal: 688e

Square: 716418756

Square Root: 163.60317845323178

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 σ(k) = σ(k+9). A15877

G.f. A(x) satisfies: [x^n-1] (1 + x·A(x)ⁿ)ⁿ / A(x)ⁿ = 0 for n>1. A303063

Poincaré series [or Poincare series] for depths of roots in a certain root system. A19528

Number of (n+2) X (4+2) 0..2 arrays with every consecutive three elements in every row, column, diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order. A252857

Number of (n+2)X(7+2) 0..2 arrays with every consecutive three elements in every row, column, diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order. A252860

Number of products of distinct primes <= prime(n) equal to -1 (mod prime(n)). A24404

Numbers k such that (10^k - 13)/3 is prime. A280017

a(n) = ∑_{k=0..floor(n/2)} T(n,k), T given by A026758. A26766

T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every consecutive three elements in every row, column, diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order. A252861

a(n) = number of labeled graphs on n vertices (with no isolated vertices, multi-edges or loops) such that the degree of every vertex is at most 3. A110041