Properties of the Number 48501

Forty-Eight Thousand Five Hundred One

Basics

Value: 48500 → 48501 → 48502

Parity: odd

Prime: No

Previous Prime: 48497

Next Prime: 48523

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 17 × 317

Divisors: 1, 3, 9, 17, 51, 153, 317, 951, 2853, 5389

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011110101110101

Octal: 136565

Duodecimal: 24099

Hexadecimal: bd75

Square: 2352347001

Square Root: 220.22942582679545

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

T(n,k)=Number of nXk 0..1 arrays with rows in nondecreasing lexicographic order and columns in nonincreasing lexicographic order, but with exactly two mistakes. A278778

a(n) = Fibonacci(2·n+1) + 2·Fibonacci(2·n-1) - 2ⁿ - [n = 0], where [b] is the Iverson bracket of b. A84086

G.f.: ∑_n>=0 xⁿ * (d/dx)^n² x^n² * (1+x)ⁿ / (n²)!, where (d/dx)^k denotes the k-th derivative operator. A264416

Number of nX3 0..1 arrays with rows in nondecreasing lexicographic order and columns in nonincreasing lexicographic order, but with exactly two mistakes. A278773

Number of nX6 0..1 arrays with rows in nondecreasing lexicographic order and columns in nonincreasing lexicographic order, but with exactly two mistakes. A278776

a(n) = 2^n-1*(8·n-14) + 8. A48501