Properties of the Number 56231

Fifty-Six Thousand Two Hundred Thirty-One

Basics

Value: 56230 → 56231 → 56232

Parity: odd

Prime: No

Previous Prime: 56209

Next Prime: 56237

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 7 × 29 × 277

Divisors: 1, 7, 29, 203, 277, 1939, 8033, 56231

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101101110100111

Octal: 155647

Duodecimal: 2865B

Hexadecimal: dba7

Square: 3161925361

Square Root: 237.13076561256239

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

Numbers n such that φ(n) is a Fibonacci number. A280592

a(0) = ... = a(3) = 1; a(n) = a(n-4) + ∑_k=0..n-5 a(k) * a(n-k-5). A343305

a(n) is the number of complement pairs of primitive 2n-bead balanced binary necklaces. A383904

a(n) = 29 + 73·n + 37·n². A145980

Number of partitions of n into 8 parts such that every i-th smallest part (counted with multiplicity) is different from i. A244244

Form an array with 3 rows: row 1 begins with 1; all rows are increasing; each entry is sum of 2 entries above it; each number appears at most once; smallest unused number is appended to first row if possible. Sequence gives row 1. A56231

a(n) is the number of complement pairs of imprimitive (periodic) 2n-bead balanced binary necklaces. A387130