Properties of the Number 26133

Twenty-Six Thousand One Hundred Thirty-Three

Basics

Value: 26132 → 26133 → 26134

Parity: odd

Prime: No

Previous Prime: 26119

Next Prime: 26141

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 31 × 281

Divisors: 1, 3, 31, 93, 281, 843, 8711, 26133

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110011000010101

Octal: 63025

Duodecimal: 13159

Hexadecimal: 6615

Square: 682933689

Square Root: 161.65704438718407

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 ways to place 4 nonattacking knights on an n X n board. A172135

Number T(n,k) of ways to place k nonattacking knights on an n X n board; triangle T(n,k), n>=0, 0<=k<=A030978(n), read by rows. A244081

a(n) is the numerator of the sum of the reciprocals of the first n squarefree numbers. A354417

a(n) = round(n*φ¹⁴), where φ is the golden ratio, A001622. A4949

Numerator of b(n) = ∑_k'<=n 1/k', where k' denotes the squarefree numbers. A72980

a(n) is the number of sets modulo n which can be formed by a finite arithmetic sequence. A331503

G.f. A(x) satisfies A(x) = (1 + x·A(x)/(1 - x·A(x))³)². A365135

Number of Frobenius equivalence classes of size n over GF(2ⁿ) with their trace equal to the trace of their inverse. A137503

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), (0, -1, 1), (1, 0, -1), (1, 1, 0)}. A149184

a(n) = ∑_k=0..n k·A002893(k). A207323