Properties of the Number 48256

Forty-Eight Thousand Two Hundred Fifty-Six

Basics

Value: 48255 → 48256 → 48257

Parity: even

Prime: No

Previous Prime: 48247

Next Prime: 48259

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ⁷ × 13 × 29

Divisors: 1, 2, 4, 8, 13, 16, 26, 29, 32, 52

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011110010000000

Octal: 136200

Duodecimal: 23B14

Hexadecimal: bc80

Square: 2328641536

Square Root: 219.6724834839357

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

Numbers k that divide the number of partitions of k into distinct parts (A000009). A56848

a(n) = 2·a(n-1) - 6·a(n-2), a(0)=0, a(1)=1. A88139

Coefficient triangle of polynomials (rising powers) related to Pell number convolutions. Companion triangle is A058403. A58402

Number of partitions of n with n sorts of part 1. A292462

Coefficient triangle of polynomials (falling powers) related to Pell number convolutions. Companion triangle is A058405. A58404

Row sums of triangle A099602, in which row n equals the inverse binomial transform of column n of the triangle of trinomial coefficients (A027907). A99603

a(n) = S(n,3) where S(n,m) = ∑_k=0..n binomial(n,k)*Fibonacci(m·k). A87635

Number of n X 4 binary arrays with each 1 adjacent to exactly two other 1s. A183325

Number of (n+2)X(1+2) 0..2 arrays with every row, column, diagonal or antidiagonal in each 3X3 subblock summing to a prime. A251812

Triangular array read by rows: T(n,0) = 2ⁿ, T(n,k) = ∑_{i=n-k..n, j=0..i-n+k, i<>n or j<>k} T(i,j) for k > 0. A337129