Properties of the Number 5362

Five Thousand Three Hundred Sixty-Two

Basics

Value: 5361 → 5362 → 5363

Parity: even

Prime: No

Previous Prime: 5351

Next Prime: 5381

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 7 × 383

Divisors: 1, 2, 7, 14, 383, 766, 2681, 5362

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010011110010

Octal: 12362

Duodecimal: 312A

Hexadecimal: 14f2

Square: 28751044

Square Root: 73.22567855609124

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 every digit occurs at least once in n³. A119735

Sum of the denominators of the Farey series of order n (A006843). A240877

Number of integer partitions of n with a unique composite part. A379302

T(n,k) = 1/20 of the number of (n+1) X (k+1) 0..4 arrays with every 2 X 2 subblock strictly increasing clockwise or counterclockwise with one decrease. A183719

Triangle read by rows: T(n,k) is the number of rooted toroidal maps with n edges and k faces and without separating cycles or isthmuses, n >= 2, k = 1..n-1. A343090

Numbers that are the sum of seven fourth powers in exactly three ways. A345825

Expansion of φ(-x)² * f(-x)⁶ + 32·x * ψ(-x)² * f(-x⁴)⁶ in powers of·where φ(), ψ(), f() are Ramanujan θ functions. A215601

T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 4 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. A300973

Number of integer partitions whose sum of primes of parts equals their sum of parts plus n. A331387

Number of possible chess diagrams after n plies. A19319