Properties of the Number 26302

Twenty-Six Thousand Three Hundred Two

Basics

Value: 26301 → 26302 → 26303

Parity: even

Prime: No

Previous Prime: 26297

Next Prime: 26309

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 × 13151

Divisors: 1, 2, 13151, 26302

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110011010111110

Octal: 63276

Duodecimal: 1327A

Hexadecimal: 66be

Square: 691795204

Square Root: 162.17891354920343

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

All 81 combinations of prefixing and following a(n) by a single digit are nonprime. A32734

Expansion of f(-x, x²) / f(-x, -x³)³ in powers of·where f(, ) is Ramanujan's general θ function. A263993

Composite numbers k such that all the decimal concatenations ik and ikj (i, j = 1...9) are also composite. A32737

Expansion of f(x, x²) / ψ(x)³ in powers of·where ψ(), f(, ) are Ramanujan θ functions. A258092

a(1)=1; for n>1, a(n) = least integer greater than a(n-1) such that the sums of the divisors of the pairwise sums of a(1),...,a(n) are all distinct. A293542

Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 84 ones. A31852

Number of (n+2) X (7+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 3 5 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 3 5 6 or 7. A252383

a(n) = number of (s(0), s(1), ..., s(n)) such that s(i) is a nonnegative integer and |s(i) - s(i-1)| <= 1 for i = 1,2,...,n, s(0) = 0, s(2n) = n. Also a(n) = T(2n,n), where T is the array in A026300. A26302

Array read by ascending antidiagonals: A(n,k) is the total number of inner points of n-Fibonacci polyominoes with k columns, where k > 0. A378707