Properties of the Number 49928

Forty-Nine Thousand Nine Hundred Twenty-Eight

Basics

Value: 49927 → 49928 → 49929

Parity: even

Prime: No

Previous Prime: 49927

Next Prime: 49937

Digit Sum: 32

Digital Root: 5

Palindrome: No

Factorization: 2 ³ × 79 ²

Divisors: 1, 2, 4, 8, 79, 158, 316, 632, 6241, 12482

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100001100001000

Octal: 141410

Duodecimal: 24A88

Hexadecimal: c308

Square: 2492805184

Square Root: 223.44574285494903

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 binary matrices M with rows in strictly increasing order and rows of M·Mtranspose (mod 2) in strictly decreasing order. A181274

Numbers n (other than powers of 2) such that abs(abundance(n)) is an odd square. A188484

Langton's ant on a three-dimensional grid: iterations where the ant passes through the origin. A308563

Triangle read by rows: T(m,n) (m >= n >= 1) = number of edges formed by drawing the line segments connecting any two of the (m+1) X (n+1) lattice points in an m X n grid of squares and extending them to the boundary of the grid. A333283

Number of rectangles in a pyramid built with squares. The squares counted in A092498 are excluded. A134507

Row sums of triangle A360173. A360229

Number of 3 X n binary matrices M with rows in strictly increasing order and rows of M·Mtranspose (mod 2) in strictly decreasing order. A181279

∏_n>=1 (1 + xⁿ)^a(n) = 1 + ∑_n>=1 μ(n)*xⁿ, where μ = A008683. A353927

G.f. A(x) satisfies A(x) = 1/( 1 - 4·x*(1 + x)*A(x) )^1/2. A372086

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