Properties of the Number 48971

Forty-Eight Thousand Nine Hundred Seventy-One

Basics

Value: 48970 → 48971 → 48972

Parity: odd

Prime: No

Previous Prime: 48953

Next Prime: 48973

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 13 × 3767

Divisors: 1, 13, 3767, 48971

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011111101001011

Octal: 137513

Duodecimal: 2440B

Hexadecimal: bf4b

Square: 2398158841

Square Root: 221.29392219399068

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

Triangle T(n,p) read by rows: the number of occurrences of p in the restricted growth functions of length n. A270236

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every element both >= and <= some horizontal, diagonal or antidiagonal neighbor. A232414

Positive integers of the form (30·m²+1)/11. A179339

Sum of the sizes of the second blocks in all set partitions of {1,2,...,n}. A270494

Number of (n+1) X (2+1) 0..2 arrays with every element both >= and <= some horizontal, diagonal or antidiagonal neighbor. A232408

Number of (3+1)X(n+1) 0..2 arrays with every element both >= and <= some horizontal, diagonal or antidiagonal neighbor. A232417

Let d(n) = number of distinct primes dividing n (A001221); sequence gives t such that d(t)=d(t+1)=...=d(t+n-1) is a run of record length. A48971