Properties of the Number 26135

Twenty-Six Thousand One Hundred Thirty-Five

Basics

Value: 26134 → 26135 → 26136

Parity: odd

Prime: No

Previous Prime: 26119

Next Prime: 26141

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 5 × 5227

Divisors: 1, 5, 5227, 26135

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110011000010111

Octal: 63027

Duodecimal: 1315B

Hexadecimal: 6617

Square: 683038225

Square Root: 161.6632302040263

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

G.f.: 1 + ∑_n>=1 a(n)*xⁿ/(1 - xⁿ) = ∏_n>=1 (1 + n·xⁿ). A300278

Triangle read by rows. Number T(n, k) of partitions of the multiset [1, 1, 1, 1, 2, 2, 2, 2, ..., n, n, n, n] into k nonempty submultisets, for 1 <= k <= 4n. A358722

a(n) = 24·n² - 1. A158544

a(n) = 54·n² - 1. A158656

Number of partitions of 2n that describe the degree sequence of exactly one labeled multigraph with no loops. A328863

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (-1, 0, 1), (-1, 1, -1), (1, 0, 0)}. A148507

Number of disconnected 7-regular (septic) graphs on 2n vertices. A165877

Number of disconnected 8-regular simple graphs on n vertices. A165878

Number of (s(0),s(1),...,s(n)) such that every s(i) is a nonnegative integer, s(0) = 1, |s(1) - s(0)| = 1, |s(i) - s(i-1)| <= 1 for i >= 2. Also sum of numbers in row n+1 of the array T defined in A026120. A26135