Properties of the Number 26398

Twenty-Six Thousand Three Hundred Ninety-Eight

Basics

Value: 26397 → 26398 → 26399

Parity: even

Prime: No

Previous Prime: 26393

Next Prime: 26399

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 × 67 × 197

Divisors: 1, 2, 67, 134, 197, 394, 13199, 26398

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110011100011110

Octal: 63436

Duodecimal: 1333A

Hexadecimal: 671e

Square: 696854404

Square Root: 162.4746134016019

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 hybrid binary trees with n internal nodes. A7863

Number A(n,k) of hybrid k-ary trees with n internal nodes; square array A(n,k), n>=0, k>=1, read by antidiagonals. A245049

The number of odd numbers that require n Collatz (3x+1) iterations to reach 1. A176866

Indices of squares of primes in A098550. A251240

Augmentation of the Fibonacci triangle A193588. See Comments. A193589

a(n) = 6ⁿ - 5ⁿ - 4ⁿ - 3ⁿ + 3·2ⁿ. A81685

Triangle of numbers of hybrid rooted trees (divided by Fibonacci numbers). A11274

n·a(n) = 2*(2·n-1)*a(n-1) + 4*(n-1)*a(n-2) with a(0) = 1. A6139

Define K(n) = Integral_t=-1..1 (t²ⁿ*(1-t²)²ⁿ/(1+it)³ⁿ⁺¹)dt, and write K(n) = a(n)*π - b(n)/c(n) where a(n), b(n), c(n) are positive integers; the sequence gives a(n). A123178

G.f. satisfies A(x) = (1 + x·A(x)) * (1 + 2·x*A(x)²). A216314