Properties of the Number 48283

Forty-Eight Thousand Two Hundred Eighty-Three

Basics

Value: 48282 → 48283 → 48284

Parity: odd

Prime: No

Previous Prime: 48281

Next Prime: 48299

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 53 × 911

Divisors: 1, 53, 911, 48283

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011110010011011

Octal: 136233

Duodecimal: 23B37

Hexadecimal: bc9b

Square: 2331248089

Square Root: 219.7339300153711

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

G.f.: ∏_k>=1 (1+x^k)^2·k-1. A255835

Strong pseudoprimes to base 11. A20237

Compound filter: a(n) = P(σ(n), σ(2n)), where P(n,k) is sequence A000027 used as a pairing function, and σ is the sum of divisors (A000203). A286359

Number of partitions of n into exactly 7 different parts with distinct multiplicities. A212118

Number of n X 6 arrays of the minimum value of corresponding elements and their horizontal or vertical neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..1 n X 6 array. A219500

Number of length 4+3 0..n arrays with every four consecutive terms having the sum of some three elements equal to three times the fourth. A248541

a(0) = a(1) = 1; a(n+2) = ∑_k=0..n (binomial(n,k) mod 2) * a(k). A331520

For k >= a(n), there are A048284(n) numbers expressible as a sum of exactly k-n k-gonal numbers. A48283