Properties of the Number 26907

Twenty-Six Thousand Nine Hundred Seven

Basics

Value: 26906 → 26907 → 26908

Parity: odd

Prime: No

Previous Prime: 26903

Next Prime: 26921

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 8969

Divisors: 1, 3, 8969, 26907

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110100100011011

Octal: 64433

Duodecimal: 136A3

Hexadecimal: 691b

Square: 723986649

Square Root: 164.03353315709566

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 and 2·k, taken together are pandigital. A115922

Sum of the second largest parts in the partitions of n into 6 parts. A308872

a(n) = 28·n² - 1. A158554

G.f. A(x) satisfies A(x) = 1 + x/(1-x³)³ * A(x)². A390104

a(n) = 961·n - 1. A158412

a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = A001950 (upper Wythoff sequence). A24689

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (0, 1, 1), (1, -1, -1), (1, 1, -1)}. A148892

Triangular array T read by rows (9-diamondization of Pascal's triangle). Step 1: t(n,k) = sum of 9 entries in diamond-shaped subarray of Pascal's triangle having vertices C(n,k), C(n+4,k+2), C(n+2,k), C(n+2,k+2). Step 2: T(n,k) = t(n,k) - t(0,0) + 1. A26907

The Wiener index of the dendrimer D₁[n], defined pictorially in the A. R. Ashrafi et al. reference. A224429

Number of nX4 0..4 arrays with each element·equal to the number its horizontal and vertical neighbors equal to 4,3,0,2,2 for x=0,1,2,3,4. A197557