Properties of the Number 9490

Nine Thousand Four Hundred Ninety

Basics

Value: 9489 → 9490 → 9491

Parity: even

Prime: No

Previous Prime: 9479

Next Prime: 9491

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 × 5 × 13 × 73

Divisors: 1, 2, 5, 10, 13, 26, 65, 73, 130, 146

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 10010100010010

Octal: 22422

Duodecimal: 55AA

Hexadecimal: 2512

Square: 90060100

Square Root: 97.41663102366043

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

Palindromic numbers in bases 3 and 8 written in base 10. A259381

A Catalan transform of the Fibonacci numbers. A109262

Expansion of ∏_k=1..8 theta₃(q^k), where theta₃() is the Jacobi θ function. A320234

T(n,k) = Number of (n+1) X (k+1) 0..1 arrays with the permanents of 2X2 subblocks nondecreasing rightwards and downwards. A204723

T(n,k) is the number of (n+1) X (k+1) 0..1 arrays with rows and columns of permanents of all 2 X 2 subblocks lexicographically nondecreasing. A204962

Numbers that are the sum of five fourth powers in three or more ways. A344243

Numbers that are the sum of five fourth powers in exactly three ways. A344244

Numbers that are the sum of ten fourth powers in exactly nine ways. A345861

Triangle T(n,k) giving number of fixed 3 X k polyominoes with n cells (n >= 3, 1<=k<=n-2). A59679

Riordan array (1/(1 - x·c(x) - x²*c(x)²), x·c(x)) where c(x) is the g.f. of A000108. A109267