ℕ atory
Play Now

Properties of the Number 26006

Twenty-Six Thousand Six

Basics

Value: 26005 → 26006 → 26007

Parity: even

Prime: No

Previous Prime: 26003

Next Prime: 26017

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 13003

Divisors: 1, 2, 13003, 26006

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110010110010110

Octal: 62626

Duodecimal: 13072

Hexadecimal: 6596

Square: 676312036

Square Root: 161.2637591029057

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

T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal or vertical neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 nXk array. A219595
Sum of the lengths of the cycle types of the permutation created by length sorting on the partitions of n. A36056
a(n) = ∑k=1..n (binomial(n, k) * 2k) (mod 3k). A386661
Number of nX5 arrays of the minimum value of corresponding elements and their horizontal or vertical neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 nX5 array. A219592
Number of 5Xn arrays of the minimum value of corresponding elements and their horizontal or vertical neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 5Xn array. A219598
Number of 4Xn integer arrays with each element equal to the number of horizontal and antidiagonal neighbors not equal to itself. A265994
s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = A000201 (lower Wythoff sequence). A24464
a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = A000201 (lower Wythoff sequence). A25084
Base-4 digits are, in order, the first n terms of the periodic sequence with initial period 1,2,1. A37537
E.g.f.: exp(x+x2/2!+x3/3!)/(1-x). A130908