Properties of the Number 48765

Forty-Eight Thousand Seven Hundred Sixty-Five

Basics

Value: 48764 → 48765 → 48766

Parity: odd

Prime: No

Previous Prime: 48761

Next Prime: 48767

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 × 3251

Divisors: 1, 3, 5, 15, 3251, 9753, 16255, 48765

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1011111001111101

Octal: 137175

Duodecimal: 24279

Hexadecimal: be7d

Square: 2378025225

Square Root: 220.82798735667544

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

Square array T(n,k), n>=0, k>=0, read by antidiagonals, where T(0,k) = 1 and T(n,k) = (1/n) * ∑_j=1..n 3^j * binomial(n,j) * binomial(k·n,j-1) for n > 0. A336575

Number of partitions of n into decimal palindromes. A91580

Number of partitions of n into decimal repdigit numbers. A88669

Number of n-node unlabeled rooted trees with thickening limbs and root outdegree (branching factor) 7. A245147

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 145", based on the 5-celled von Neumann neighborhood. A270288

Squarefree numbers: numbers that are not divisible by a square greater than 1. A5117

G.f. A(x) satisfies [x^2·n] A(x)^5·n = -5 and [x^2·n+1] A(x)^5·n+2 = [x^2·n+1] A(x)^5·n+3 for n >= 1. A377096

Smallest factorial >= n. A48765