Properties of the Number 49369

Forty-Nine Thousand Three Hundred Sixty-Nine

Basics

Value: 49368 → 49369 → 49370

Parity: odd

Prime: Yes

Previous Prime: 49367

Next Prime: 49391

Digit Sum: 31

Digital Root: 4

Palindrome: No

Factorization: 49369

Divisors: 1, 49369

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100000011011001

Octal: 140331

Duodecimal: 246A1

Hexadecimal: c0d9

Square: 2437298161

Square Root: 222.19135896789507

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

Primes of the form 2·n² + 46·n + 21. A217495

a(n) = Sum {k + j·m <= n} (k + j·m), with 0 < k,j,m <= n. A106847

Total number of vertices in the graph (see A392172) 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. A392173

Least inverse of A001390, or 0 if no inverse exists. A20638

The smallest prime(m) such that prime(m) = (prime(m+k)+prime(m-k))/2 for n values of k. A189802

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with no 2X2 subblock having the sum of its diagonal elements greater than the maximum of its antidiagonal elements. A251128

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 vertices in the resulting planar graph. A392261

Number of n-node planar graphs with minimum degree at least 1. A49369