Properties of the Number 49816

Forty-Nine Thousand Eight Hundred Sixteen

Basics

Value: 49815 → 49816 → 49817

Parity: even

Prime: No

Previous Prime: 49811

Next Prime: 49823

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 ³ × 13 × 479

Divisors: 1, 2, 4, 8, 13, 26, 52, 104, 479, 958

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100001010011000

Octal: 141230

Duodecimal: 249B4

Hexadecimal: c298

Square: 2481633856

Square Root: 223.19498202244603

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

Number of regions formed when n points are placed in general position on each edge of a square and a chord is drawn from each point to the 3·n points on the other three sides. A392172

Number of ordered triples (w,x,y) with all terms in {-n,...-1,1,...,n} and w²>x²+y². A211631

Number of (n+2)X(5+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00010101. A260838

Numbers k such that 111·2^k+1 is prime. A32405

Triangular array T read by rows: T(n,k) = number of nonzero remainders when Euclidean algorithm acts on n and k, for k=1..n, n>=1. A49816

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00010101. A260841

Array read by antidiagonals: Place k points in general position on each side of a regular n-gon and join every pair of the k·n boundary points by a chord; T(n,k) (n >= 3, k >= 0) gives the number of regions in the resulting planar graph. A392228