Properties of the Number 49974

Forty-Nine Thousand Nine Hundred Seventy-Four

Basics

Value: 49973 → 49974 → 49975

Parity: even

Prime: No

Previous Prime: 49957

Next Prime: 49991

Digit Sum: 33

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 8329

Divisors: 1, 2, 3, 6, 8329, 16658, 24987, 49974

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100001100110110

Octal: 141466

Duodecimal: 24B06

Hexadecimal: c336

Square: 2497400676

Square Root: 223.54865242268852

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

Numbers which are the sum of their proper divisors containing the digit 8. A59467

Sum of the squares of q-binomial coefficients for q=2 in row n of triangle A022166, for n >= 0. A243950

Number of horizontally convex n-ominoes in which the top row has exactly 1 square, which is not above the rightmost square in the second row. A49221

Numbers k with maximal exponent in prime factorization equal to 1, such that k+1 has maximal exponent 2, k+2 has maximal exponent 3, and k+3 has maximal exponent 4. A176913

Number of (2+2)X(n+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 1 3 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 1 3 6 or 7. A252307

Number of walks within N² (the first quadrant of Z²) starting at (0,0) and consisting of n steps taken from {(-1, -1), (-1, 1), (-1, 0), (0, -1), (0, 1), (1, -1), (1, 1)}. A151314

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 1 3 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 1 3 6 or 7. A252305

Self-convolution square-root of A243950, which is the sums of the squares of the q-binomial coefficients for q=2 in rows of triangle A022166. A243951

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