Properties of the Number 48521

Forty-Eight Thousand Five Hundred Twenty-One

Basics

Value: 48520 → 48521 → 48522

Parity: odd

Prime: No

Previous Prime: 48497

Next Prime: 48523

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 11 ² × 401

Divisors: 1, 11, 121, 401, 4411, 48521

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011110110001001

Octal: 136611

Duodecimal: 240B5

Hexadecimal: bd89

Square: 2354287441

Square Root: 220.27482833950864

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

Index of n-th low point in A008348 (see Comments for definition). A309226

a(n) = ∑_i=0..n digsum₅(i)⁴, where digsum₅(i) = A053824(i). A231671

E.g.f. satisfies A(x) = exp(x·A(x)² * (1 + x·A(x)²)). A363358

Numbers·such that σ(x) + σ(R(x)) = σ(x + R(x)), where R(x) is the digit reversal of·and σ(x) is the sum of the divisors of x. A246487

Result of inserting the integers n = 0, 1, 2, ... in this order into an initially empty list, where n is inserted between the pair of consecutive elements with sum equal to n and minimal absolute difference, or at the end of the list if no such pair exists. A360447

A symmetrical triangle sequence based on:q=1/12;t(n,m,q)=12*(Binomial[n, m]*(1 - q) + (((n + m + 1)!/((n + 1)!* m!)) + ((2·n - m + 1)!/((n + 1)!*(n - m)!)))*q). A174948

Primes expressible as the sum of an integer plus its digit sum. A48521