Properties of the Number 9039

Nine Thousand Thirty-Nine

Basics

Value: 9038 → 9039 → 9040

Parity: odd

Prime: No

Previous Prime: 9029

Next Prime: 9041

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 23 × 131

Divisors: 1, 3, 23, 69, 131, 393, 3013, 9039

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 10001101001111

Octal: 21517

Duodecimal: 5293

Hexadecimal: 234f

Square: 81703521

Square Root: 95.07365565707464

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

Generalized Mancala solitaire (A002491); to get n-th term, start with n and successively round up to next 10 multiples of n-1, n-2, ..., 1, for n>=1. A113747

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 0 1 0 vertically. A208164

G.f. satisfies: A(x) = ∑_n>=0 x^n² * A(x)ⁿ. A157134

Number of n-bit legal circular binary words with maximal set of 1's. A253413

Expansion of ∏_k>=1 (1 + x^3·k-1)^3·k-1. A262948

Numbers which need eleven 'Reverse and Add' steps to reach a palindrome. A65216

Minimal k > n such that (4·k+3·n) * (4·n+3·k) is a square. A83752

Position of 2ⁿ in A051037 (5-smooth numbers). A188425

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of B(x)^k, where B(x) is the g.f. of A384649. A384653

Numbers k such that T(k) = T(A072522(k)) + T(A072522(k+1)), T(i) being the triangular numbers. A80824