Properties of the Number 49915

Forty-Nine Thousand Nine Hundred Fifteen

Basics

Value: 49914 → 49915 → 49916

Parity: odd

Prime: No

Previous Prime: 49891

Next Prime: 49919

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 5 × 67 × 149

Divisors: 1, 5, 67, 149, 335, 745, 9983, 49915

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100001011111011

Octal: 141373

Duodecimal: 24A77

Hexadecimal: c2fb

Square: 2491507225

Square Root: 223.4166511252015

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 partitions of the (n+4)-multiset {0,...,0,1,2,3,4} with n 0's into distinct multisets. A346824

a(n) = K₃(n) = ∑_k>=0 A090285(3,k)*2^k*binomial(n,k). a(n) = (4·n³+30·n²+56·n+15)/3. A90294

a(n) = ∑_k=0..n 2^k*C([(n+k)/2],k)*C([(n+k+1)/2],k) where [x]=floor(x). A124431

a(n) is the smallest m for which binomial(m, 6) has exactly n distinct prime factors. A321852

a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2·n - 2 - 2^p+1 and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1, a(2) = 2 and a(3) = 4. A49915