Properties of the Number 5352

Five Thousand Three Hundred Fifty-Two

Basics

Value: 5351 → 5352 → 5353

Parity: even

Prime: No

Previous Prime: 5351

Next Prime: 5381

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ³ × 3 × 223

Divisors: 1, 2, 3, 4, 6, 8, 12, 24, 223, 446

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1010011101000

Octal: 12350

Duodecimal: 3120

Hexadecimal: 14e8

Square: 28643904

Square Root: 73.15736463268753

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

Positive numbers whose product of digits is 10 times their sum. A62043

T(n,k) is the number of (n+1) X (k+1) 0..2 arrays with column and row pair sums b(i,j) = a(i,j) + a(i,j-1) and c(i,j) = a(i,j) + a(i-1,j) such that rows of b(i,j) and columns of c(i,j) are lexicographically nondecreasing. A203965

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically, diagonally or antidiagonally exactly two different ways, and new values 0..1 introduced in row major order. A204867

T(n,k) = number of (n+1) X (k+1) 0..2 arrays with every 2 X 3 or 3 X 2 subblock having an unequal number of clockwise and counterclockwise edge increases. A206685

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 00000001 or 00000011. A259894

Number of lone-child-avoiding locally disjoint rooted trees whose leaves are integer partitions whose multiset union is an integer partition of n. A331678

Triangle read by rows: T(n,k) is the number of tree-rooted planar maps with n edges, k faces and no isthmuses, n >= 0, k = 1..n+1. A342987

a(n) = (p(n)*p(n+2) - p(n+1))/2, where p(n) is the n-th odd prime. A152531

An Ulam-type sequence: a(n) = n if n<=9; for n>9, a(n) = least number > a(n-1) which is a unique sum of 9 distinct earlier terms. A183532

Abundant numbers that differ from the next abundant number by 3. A228382