Properties of the Number 26567

Twenty-Six Thousand Five Hundred Sixty-Seven

Basics

Value: 26566 → 26567 → 26568

Parity: odd

Prime: No

Previous Prime: 26561

Next Prime: 26573

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 31 × 857

Divisors: 1, 31, 857, 26567

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110011111000111

Octal: 63707

Duodecimal: 1345B

Hexadecimal: 67c7

Square: 705805489

Square Root: 162.993864915217

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

a(n) = prime(n)² - 2. A49001

Position of 5ⁿ in A051037 (5-smooth numbers). A188427

Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 78", based on the 5-celled von Neumann neighborhood. A278789

Array read by diagonals downwards: A(n,k) for n>=2 and k>=0 is the number of (n,k)-polyominoes. A381030

Upper (3/2)-midsequence of (F(2n)) and (F(2n+1)), where F=A000045 (Fibonacci numbers); see Comments. A387781

a(n) = a(n-1) + 7·a(n-2) for n >= 2, a(0)=1, a(1)=2. A133469

Total number of parts that are the smallest part or the largest part in all partitions of n. A182978

a(n) = 2·a(n-1) - a(n-2) + a(n-4), n>3, a(0)=0, a(1)=a(2)=1, a(3)=3. A286311

a(n) = ceiling(A173497(n)/2). A173508

Upper (1/2)-midsequence of F(n) and F(n+4), where F = A000045 (Fibonacci numbers); see Comments. A390351