Properties of the Number 48685

Forty-Eight Thousand Six Hundred Eighty-Five

Basics

Value: 48684 → 48685 → 48686

Parity: odd

Prime: No

Previous Prime: 48679

Next Prime: 48731

Digit Sum: 31

Digital Root: 4

Palindrome: No

Factorization: 5 × 7 × 13 × 107

Divisors: 1, 5, 7, 13, 35, 65, 91, 107, 455, 535

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011111000101101

Octal: 137055

Duodecimal: 24211

Hexadecimal: be2d

Square: 2370229225

Square Root: 220.64677654568172

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, read by rows, where row n forms a polynomial in y=3·k that generates diagonal n as k=0,1,2,... for n>=0; thus T(n,k) = ∑_j=0..n-k T(n-k,j)*(3·k)^j, with T(n,0)=T(n,n)=1. A113716

a(1)=1; for n>1, a(n) = a(n-1) + n⁰ if n odd, a(n) = a(n-1) + n³ if n is even. A135332

Number of 5-ary rooted trees with n nodes and height exactly 4. A36635

Number of nX2 0..2 arrays with rows and columns lexicographically nondecreasing and the instance counts of every value within one of each other. A201426

Tetraprimes (or products of exactly four distinct prime numbers) that are the sum of two successive tetraprimes. A380348

a(n) is the number of times the maximum value of ω(binomial(n, k)) occurs in the n-th row of Pascal's triangle, where ω(n) is the number of prime divisors of n counted with multiplicity (A001222). A48685