Properties of the Number 26068

Twenty-Six Thousand Sixty-Eight

Basics

Value: 26067 → 26068 → 26069

Parity: even

Prime: No

Previous Prime: 26053

Next Prime: 26083

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 7 ³ × 19

Divisors: 1, 2, 4, 7, 14, 19, 28, 38, 49, 76

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110010111010100

Octal: 62724

Duodecimal: 13104

Hexadecimal: 65d4

Square: 679540624

Square Root: 161.45587632539113

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 integer partitions of n having a unique mode. A362608

T(n,k)=Number of nXk 0..1 arrays with no element unequal to a strict majority of its horizontal, vertical and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A280161

Third accumulation array, T, of the natural number array A000027, by antidiagonals. A185508

E.g.f.: exp(4)*P(x) - Q(x), where P(x) = 1/∏_n>=1 (1 - xⁿ/n) and Q(x) = ∑_n>=1 4ⁿ/∏_k=1..n (k - x^k). A249477

Numbers n such that n² + 1 is divisible by a 5th power. A218564

Numbers k such that φ(k)*σ(k) is a cube. A114077

Column 4 of A060244. A291589

Number of rooted graceful labelings with n edges. A338987

a(n) = ∑_k=0..n (-1)^k * binomial(n+2·k+1,n-k) * Fibonacci(k+1). A390856

Numbers k such that sopf(k) = d(k) where d(k) = A001223(k) and sopf(k) = A008472(k). A64010