Properties of the Number 8352

Eight Thousand Three Hundred Fifty-Two

Basics

Value: 8351 → 8352 → 8353

Parity: even

Prime: No

Previous Prime: 8329

Next Prime: 8353

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ⁵ × 3 ² × 29

Divisors: 1, 2, 3, 4, 6, 8, 9, 12, 16, 18

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 10000010100000

Octal: 20240

Duodecimal: 4A00

Hexadecimal: 20a0

Square: 69755904

Square Root: 91.3892772703669

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

Partial sums of A243980. A244050

Numbers that can be expressed as the difference of the squares of primes in just three distinct ways. A90782

Number T(n,k) of permutations of {1,2,...,n} that result in a binary search tree of height k; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A195581

Numbers k such that σ(x) = k has exactly 9 solutions. A60665

3 times 12-gonal (or dodecagonal) numbers: a(n) = 3·n*(5·n-4). A153448

T(n,k)=Number of length-n 0..k arrays with no following elements larger than the first repeated value. A267471

Array read by descending antidiagonals: A(n,k) is the number of achiral colorings of the edges of a regular n-dimensional simplex using up to k colors. A327086

T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 3 or 4. A252075

Array read by antidiagonals: T(n,k) = number of n-step knight's tours on a (k+2)X(k+2) board summed over all starting positions. A186851

Numbers that are the sum of five third powers in nine or more ways. A345185