Properties of the Number 13048

Thirteen Thousand Forty-Eight

Basics

Value: 13047 → 13048 → 13049

Parity: even

Prime: No

Previous Prime: 13043

Next Prime: 13049

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ³ × 7 × 233

Divisors: 1, 2, 4, 7, 8, 14, 28, 56, 233, 466

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 11001011111000

Octal: 31370

Duodecimal: 7674

Hexadecimal: 32f8

Square: 170250304

Square Root: 114.22784249034909

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

Number of partitions of n such that all parts, with the possible exception of the smallest, appear only once. A115029

Square array, read by antidiagonals, used to recursively calculate the number of minimax trees A080795. A185420

Number of rooted binary unordered tanglegrams of size n. A259114

a(n) = Fibonacci(n)*A034896(n) for n >= 1, with a(0)=1, where A034896 lists the number of solutions to a² + b² + 3·c² + 3·d² = n. A205971

a(n) = T(3,n), array T given by A048505. A48508

a(n) = 686·n + 14. A157366

a(n) = Fibonacci(n)*A028594(n) for n>=1, with a(0)=1, where A028594 lists the coefficients in (theta₃(x)*theta₃(7·x)+theta₂(x)*theta₂(7·x))². A205976

Expansion of ∏_k>=0 ((1+x^3·k+1)/(1-x^3·k+1))². A261649

Convolution of A006068 (inverse of Gray code) with itself: a(n) = ∑_k=1..n+1 A006068(k) * A006068(1+n-k). A268721

a(1)=1. For m >= 0 and 1 <= k <= 2^m, a(2^m +k) = a(k) + ∑_j=1..2^m a(j). A139485