Properties of the Number 26638

Twenty-Six Thousand Six Hundred Thirty-Eight

Basics

Value: 26637 → 26638 → 26639

Parity: even

Prime: No

Previous Prime: 26633

Next Prime: 26641

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 × 19 × 701

Divisors: 1, 2, 19, 38, 701, 1402, 13319, 26638

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110100000001110

Octal: 64016

Duodecimal: 134BA

Hexadecimal: 680e

Square: 709583044

Square Root: 163.2115192013113

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 semi-sums of integer partitions of n. A366738

Number of 3rd-order maximal independent sets in cycle graph. A7387

a(n)=a(n-2)+a(n-5). A133394

G.f.: ∑_k>=0 x^k² / ∏_j=1..k (1 - x^2·j-1)². A376581

Position of first repeat of the opening sequence of length n occurring after the first repeat of the opening sequence of length n-1 in the Kolakoski sequence (A000002). A74300

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), (0, 1, -1), (0, 1, 1), (1, 0, 0), (1, 1, 1)}. A151203

Numbers m such that m² + 3^k is prime for k = 1, 2, 3. A177173

a(n) = n * (binomial(n,2) - 2). A341768

a(n) = A026637(2·n, n). A26638

Array read by antidiagonals upwards: A(n, k) = if(n mod 2 = 0, floor((n+2^k-2) / 2^k), n * (k·2^k+1) + 1). A391114