Properties of the Number 26427

Twenty-Six Thousand Four Hundred Twenty-Seven

Basics

Value: 26426 → 26427 → 26428

Parity: odd

Prime: No

Previous Prime: 26423

Next Prime: 26431

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 23 × 383

Divisors: 1, 3, 23, 69, 383, 1149, 8809, 26427

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110011100111011

Octal: 63473

Duodecimal: 13363

Hexadecimal: 673b

Square: 698386329

Square Root: 162.56383361621366

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

Expansion of ∏_k>=1 (1 + ((1 - sqrt(1 - 4·x))/2)^k). A307496

Table of Encoded Bell Multisets using A064553 (cf. A129305). A130274

Solution of the complementary equation a(n) = 4·a(n-2) + b(n-1) + b(n-2), where a(0) = 1, a(1) = 3, b(0) = 2, and (a(n)) and (b(n)) are increasing complementary sequences. A295063

Triangular array read by rows: row n shows the coefficients of the polynomial u(n) = c(0) + c(1)*x + ... + c(n)*xⁿ which is the denominator of the n-th convergent of the continued fraction [k, k, k, ... ], where k = (x + 2)/(x + 1). A231733

Compositions (ordered partitions) of n into odd parts where the first part must be a maximal part. A368746

Number of fixed strictly disconnected n-ominoes bounded (not necessarily tightly) by an n·n square. A162678

a(n) = least positive integer > a(n-1) and not equal to a(i)*a(j) for 1<=i<=j<=n. A26427

A triangular array of numbers related to factorization and number of parts in Murasaki diagrams. A133611