Properties of the Number 48875

Forty-Eight Thousand Eight Hundred Seventy-Five

Basics

Value: 48874 → 48875 → 48876

Parity: odd

Prime: No

Previous Prime: 48871

Next Prime: 48883

Digit Sum: 32

Digital Root: 5

Palindrome: No

Factorization: 5 ³ × 17 × 23

Divisors: 1, 5, 17, 23, 25, 85, 115, 125, 391, 425

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011111011101011

Octal: 137353

Duodecimal: 2434B

Hexadecimal: beeb

Square: 2388765625

Square Root: 221.07690969434145

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 p of n such that 2*(number of even numbers in p) <= (number of odd numbers in p). A241652

Numerators of continued fraction convergents to sqrt(532). A42016

Absolute value of coefficient of x³ in polynomial whose zeros are 5 consecutive integers starting with the n-th integer. A127694

a(n) = 169·n² + 2·n. A158220

T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors. A186488

Array: row n shows the coefficients of the characteristic polynomial of the n-th principal submatrix of the symmetric matrix A202875; by antidiagonals. A202877

Triangle read by rows: T(n,k) is the number of free polyforms consisting of k unit square cells and n-k isosceles right triangular cells whose short sides have unit length. Cells are joined along sides of equal lengths. A391193

Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 13. A31691

Number of 5-step S, E, and NW-moving king's tours on an n X n board summed over all starting positions. A187510

T(n,m)=Number of (n+1)X6 0..m arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors. A188837