Properties of the Number 49912

Forty-Nine Thousand Nine Hundred Twelve

Basics

Value: 49911 → 49912 → 49913

Parity: even

Prime: No

Previous Prime: 49891

Next Prime: 49919

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ³ × 17 × 367

Divisors: 1, 2, 4, 8, 17, 34, 68, 136, 367, 734

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100001011111000

Octal: 141370

Duodecimal: 24A74

Hexadecimal: c2f8

Square: 2491207744

Square Root: 223.4099371111321

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

Triangle of numbers S(x,y) = number of lattice paths from (0,0) to (x,y) that use step set { (0,1), (1,0), (2,0), (3,0), ....} and never pass below y = x. A11117

Triangle read by rows: T(n,k) is number of Schroeder paths of length 2n and having k peaks at height 1, for 0 <= k <= n. A104219

Let S(x,y) = number of lattice paths from (0,0) to (x,y) that use the step set { (0,1), (1,0), (2,0), (3,0), ....} and never pass below y = x. Sequence gives S(n-3,n). A10849

Triangle read by rows: T(n,k) is the number of dissections of a convex n-gon by nonintersecting diagonals, having a k-gon over a fixed edge (base). A91370

10000n+1, 10000n+3, 10000n+7, 10000n+9 are all primes. A64963

G.f. satisfies: A(x) = (1 + x·A(x)²) * (1 + x·A(x)³). A215654

a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2·n - 3 - 2^p+1 and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1, a(2) = 2, and a(3) = 4. A49912