Properties of the Number 9484

Nine Thousand Four Hundred Eighty-Four

Basics

Value: 9483 → 9484 → 9485

Parity: even

Prime: No

Previous Prime: 9479

Next Prime: 9491

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ² × 2371

Divisors: 1, 2, 4, 2371, 4742, 9484

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10010100001100

Octal: 22414

Duodecimal: 55A4

Hexadecimal: 250c

Square: 89946256

Square Root: 97.38583059151881

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

Expansion of ψ(-q³) / f(q) where ψ(), f() are Ramanujan θ functions. A139135

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with no 3x3 subblock diagonal sum 1 and no antidiagonal sum 2 and no row sum 0 and no column sum 0. A255091

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with no 3x3 subblock diagonal sum 1 and no antidiagonal sum 1 and no row sum 0 or 1 and no column sum 0 or 1. A255159

T(n,k)=Number of nXk 0..2 arrays with no element equal to more than one of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A281139

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

T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 000 and 111 in rows and columns. A203407

G.f. satisfies: x = ∑_n>=1 1/A(x)^3·n * ∏_k=1..n (1 - 1/A(x)^k). A181997

Expansion of q^-1/3 * η(q⁶)² / (η(q) * η(q³)) in powers of q. A97197

a(n) = T(n, 2·n-7), T given by A027960. A27969

Number of Dyck paths with no UUU's and no DDD's of semilength n and having k UUDUDD's (0<=k<=floor(n/3); U=(1,1), D=(1,-1)). A162984