Properties of the Number 48505

Forty-Eight Thousand Five Hundred Five

Basics

Value: 48504 → 48505 → 48506

Parity: odd

Prime: No

Previous Prime: 48497

Next Prime: 48523

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 5 × 89 × 109

Divisors: 1, 5, 89, 109, 445, 545, 9701, 48505

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011110101111001

Octal: 136571

Duodecimal: 240A1

Hexadecimal: bd79

Square: 2352735025

Square Root: 220.238507078122

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 ways to cover (without overlapping) a ring lattice (necklace) of n sites with molecules that are 6 sites wide. A58367

Numbers k such that σ(k)/φ(k) = 25/16. A164648

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

Integers n such that for all i > n the largest prime factor of product(i+k, {k,0,12}) exceeds the largest prime factor of product(n+k, {k,0,12}). A200570

Numerators of continued fraction convergents to sqrt(491). A41936

Numbers j such that 24*(j²) + 25 = k². A106331

Record values in A375970. A375973

Array T read by diagonals, n-th difference of (T(k,n),T(k,n-1),...,T(k,0)) is (k+n)², for n=1,2,3,...; k=0,1,2,... A48505

Number of (n+1)X(5+1) 0..1 arrays with every 2X2 subblock having a single 1 or two 1s on the same edge or main diagonally. A251289

T(n,m) is the smallest number that starts a sequence of n+1 consecutive integers whose Euler totient Functions are multiples of m. A128252