Properties of the Number 8303

Eight Thousand Three Hundred Three

Basics

Value: 8302 → 8303 → 8304

Parity: odd

Prime: No

Previous Prime: 8297

Next Prime: 8311

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 19 ² × 23

Divisors: 1, 19, 23, 361, 437, 8303

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 10000001101111

Octal: 20157

Duodecimal: 497B

Hexadecimal: 206f

Square: 68939809

Square Root: 91.12079894294168

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

a(n) is the number of subsets of {1,...,n} containing no solutions to x+y=z with·and y distinct (one version of "sum-free subsets"). A85489

Number of partitions of n into nonsquares. A87153

a(n) = minimal positive k such that the concatenation of the decimal digits of n,n+1,...,n+k is divisible by n+k+1, or -1 if no such k exists. A332580

Numbers k such that 2^k - k² is prime. A72180

Take the first n numbers written in base 9, concatenate them, then convert from base 9 to base 10. A48441

Number of ways to split a strict integer partition of n into consecutive subsequences with weakly decreasing sums. A319794

Array read by antidiagonals: T(m,n) is the number of independent sets in the stacked prism graph C_m X P_n. A286513

Expansion of ∏_k>=1 1/(1 - x^2·k+1)^k. A263150

Square array A(n,k), read by descending antidiagonals, where A(1, k) = A388984(k), and for n > 1, A(n, k) = A003961(A(n-1), k). A388981

a(n) = (p_n)² * p_n+1, where p_n is the n-th prime, A000040(n). A251720