Properties of the Number 49561

Forty-Nine Thousand Five Hundred Sixty-One

Basics

Value: 49560 → 49561 → 49562

Parity: odd

Prime: No

Previous Prime: 49559

Next Prime: 49597

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 29 × 1709

Divisors: 1, 29, 1709, 49561

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100000110011001

Octal: 140631

Duodecimal: 24821

Hexadecimal: c199

Square: 2456292721

Square Root: 222.62299971027252

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

T(n,k)=Number of nXk 0..1 arrays with rows, diagonals and antidiagonals unimodal. A223669

Let S denote the palindromes in the language {0,1,2,...,n-1}*; a(n) = number of words of length 4 in the language SS. A187277

Number of binary strings of length n+10 such that the smallest number whose binary representation is not visible in the string is 10. A261475

Number of nX6 0..1 arrays with rows, diagonals and antidiagonals unimodal. A223667

Number of 4Xn 0..1 arrays with rows, diagonals and antidiagonals unimodal. A223671

Let p(n) be the n-th composite squarefree number. a(n) is the smallest integer q that forms a pure idempotent product. A325945

Primes p such that x²⁹ = 2 has a solution mod p. A49561