Properties of the Number 49162

Forty-Nine Thousand One Hundred Sixty-Two

Basics

Value: 49161 → 49162 → 49163

Parity: even

Prime: No

Previous Prime: 49157

Next Prime: 49169

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 × 47 × 523

Divisors: 1, 2, 47, 94, 523, 1046, 24581, 49162

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100000000001010

Octal: 140012

Duodecimal: 2454A

Hexadecimal: c00a

Square: 2416902244

Square Root: 221.72505496673125

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

Row sums of triangle A104505, which is equal to the right-hand side of the triangle A084610 of coefficients in (1+x-x²)ⁿ. A104507

Expansion of series related to Liouville's Last Theorem: g.f. ∑_t>=1 (-1)^t+1 *x^t*(t+1/2) / ( (1-x^t)⁷ * ∏_i=1..t (1-xⁱ) ). A59824

a(n) = number of solutions to the Diophantine equation x+y²+z³=n⁴ with positive x,y,z all distinct. A121984

1/4 the number of (n+1) X 7 0..2 arrays with every 2 X 2 subblock having distinct clockwise edge differences. A209725

Number of (n+1) X (n+1) -11..11 symmetric matrices with every 2 X 2 subblock having sum zero and two or four distinct values. A211715

Number of partitions of n into parts not of the form 17k, 17k+5 or 17k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 7 are greater than 1. A35966

Number of numbers the sum of whose digits' factorials equals n. A333499

Triangle read by rows: Coefficients of the polynomials S1(n, x) * EP(n, x), where S1 denote the unsigned Stirling cycle polynomials A132393 and EP the Eulerian polynomials A173018. A373570

Number of ways to select 5 disjoint point triples from an n X n X n triangular point grid, each point triple forming a 2 X 2 X 2 triangle. A289226

Recip transform of 2*(1 + x³ + x⁶)-1/(1-x). A49162