Properties of the Number 49671

Forty-Nine Thousand Six Hundred Seventy-One

Basics

Value: 49670 → 49671 → 49672

Parity: odd

Prime: No

Previous Prime: 49669

Next Prime: 49681

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 5519

Divisors: 1, 3, 9, 5519, 16557, 49671

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100001000000111

Octal: 141007

Duodecimal: 248B3

Hexadecimal: c207

Square: 2467208241

Square Root: 222.86991721629906

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

Poincaré series for invariant polynomial functions on the space of binary forms of degree 10. A293935

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

a(1) = a(2) = 1, a(n) = a(n-1) + A007947(a(n-2)) for n >= 3, i.e., a(n) = a(n-1) plus the largest squarefree divisor of a(n-2). A121367

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

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

Numbers k such that 2·3^k + 35 is prime. A59768

a(n) = (F(n) + F(4·n))/2, where F=A000045 (the Fibonacci sequence). A49671