Properties of the Number 48081

Forty-Eight Thousand Eighty-One

Basics

Value: 48080 → 48081 → 48082

Parity: odd

Prime: No

Previous Prime: 48079

Next Prime: 48091

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 11 × 31 × 47

Divisors: 1, 3, 11, 31, 33, 47, 93, 141, 341, 517

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011101111010001

Octal: 135721

Duodecimal: 239A9

Hexadecimal: bbd1

Square: 2311782561

Square Root: 219.27380144467784

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

E.g.f.: exp(x/(1 - 4·x)). A321847

Nonnegative values·of solutions (x, y) to the Diophantine equation x²+(x+119)² = y². A129837

a(n) = [ a(n-1)/a(1) ] + [ a(n-1)/a(2) ] + ... + [ a(n-1)/a(n-1) ] for n >= 3, with initial terms 1,1. A22855

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f. exp(x/(1-k·x)). A341033

Numbers k such that 8·10^k - 9 is prime. A103068

Triangular matrix T, read by rows, that satisfies: [T^-1](n,k) = -(k+1)*T(n-1,k) when (n-1)>=k>=0, with T(n,n) = 1 and T(n+1,n) = (n+1) for n>=0. A106208

T(n,k) = Number of (n+1) X (k+1) 0..2 arrays with every 2 X 2 subblock summing to 4 and no 2 X 2 subblock having exactly two nonzero entries. A251149

Number of nonempty subsets of {1,2,...,n} in which exactly 5/6 of the elements are <= (n+2)/3. A48081