Properties of the Number 48588

Forty-Eight Thousand Five Hundred Eighty-Eight

Basics

Value: 48587 → 48588 → 48589

Parity: even

Prime: No

Previous Prime: 48571

Next Prime: 48589

Digit Sum: 33

Digital Root: 6

Palindrome: No

Factorization: 2 ² × 3 × 4049

Divisors: 1, 2, 3, 4, 6, 12, 4049, 8098, 12147, 16196

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011110111001100

Octal: 136714

Duodecimal: 24150

Hexadecimal: bdcc

Square: 2360793744

Square Root: 220.42685861754688

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) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = floor(n/2), s = (natural numbers >= 3), t = (Fibonacci numbers). A24315

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

Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,29. A64251

Number of nX5 0..1 arrays with every element equal to 0, 2, 3, 4 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. A300920

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers >= 3), t = (F(2), F(3), F(4), ...). A24878

Number of n X n 0..1 arrays with every element equal to 0, 2, 3, 4 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. A300917

G.f. A(x) satisfies: the sum of the coefficients of x^k, k=0..n, in A(x)ⁿ equals ∑_k=0..n C(n,k)³ = A000172(n) (Franel numbers), for n>=0. A232687

G.f. satisfies A(x) = 1 + x·A(x)²*(1 + A(x))²/2. A219538

Pisot sequence L(7,8). A48588

G.f. A(x) satisfies: coefficient of xⁿ in A(x)^2·n equals A000172(n) = ∑_k=0..n C(n,k)³, the n-th Franel number. A242903