Properties of the Number 5357

Five Thousand Three Hundred Fifty-Seven

Basics

Value: 5356 → 5357 → 5358

Parity: odd

Prime: No

Previous Prime: 5351

Next Prime: 5381

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 11 × 487

Divisors: 1, 11, 487, 5357

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010011101101

Octal: 12355

Duodecimal: 3125

Hexadecimal: 14ed

Square: 28697449

Square Root: 73.19152956456095

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

Trajectory of n under the Reverse and Add! operation carried out in base 4 (presumably) does not reach a palindrome and (presumably) does not join the trajectory of any term m < n. A75421

Number of polyforms with n cells on the faces of a rhombic triacontahedron up to rotation. A383491

a(n) = (9n² + 9n + 4)/2. A62123

T(n,k)=Number of nXk 0..1 arrays avoiding 0 1 0 horizontally and 1 0 0 vertically. A206889

Numbers k such that A119682(k) is prime. A136682

T(n,k)=Number of nXk binary arrays without the pattern 0 1 0 vertically or horizontally. A188774

a(n) = n*(n² + 3)/2. A229183

Number of compositions (ordered partitions) of n into distinct parts >= 3. A339101

Compound filter (2-adic valuation & sum of the divisors): a(n) = P(A001511(n), A000203(n)), where P(n,k) is sequence A000027 used as a pairing function. A286460

Number of partitions of n avoiding any 3-term arithmetic progression. A238571