Properties of the Number 49742

Forty-Nine Thousand Seven Hundred Forty-Two

Basics

Value: 49741 → 49742 → 49743

Parity: even

Prime: No

Previous Prime: 49741

Next Prime: 49747

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 2 × 7 × 11 × 17 × 19

Divisors: 1, 2, 7, 11, 14, 17, 19, 22, 34, 38

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100001001001110

Octal: 141116

Duodecimal: 24952

Hexadecimal: c24e

Square: 2474266564

Square Root: 223.0291460773681

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 n such that σ(n) = 6*φ(n). A104900

Number of aperiodic necklaces of n beads of 2 colors, 10 of them black. A32168

Number of nonequivalent dissections of a polygon into n triangles by nonintersecting diagonals rooted at a cell up to rotation. A3441

a(n) = lcm(1,2,...,2·n) / (n·binomial(2·n, n)). A68553

a(n) = binomial(6·n + 5, 3·n + 1)/(6·n + 5). A265101

a(n) = LCM(binomial(n,0), ..., binomial(n,n)) / binomial(n,floor(n/2)). A48619

T(2n+3, n), array T as in A051168; a count of Lyndon words. A50181

Numbers k such that both k and 2·k are balanced numbers (A020492). A76375

Squarefree primitive abundant numbers (first definition: having only deficient proper divisors). A298973

A(n,k) = binomial((2·k+1)*n+2, k·n+1)/((2·k+1)*n+2), square array A(n,k) read by antidiagonals, for n >= 0, k >= 0. A306444