Properties of the Number 49917

Forty-Nine Thousand Nine Hundred Seventeen

Basics

Value: 49916 → 49917 → 49918

Parity: odd

Prime: No

Previous Prime: 49891

Next Prime: 49919

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 3 × 7 × 2377

Divisors: 1, 3, 7, 21, 2377, 7131, 16639, 49917

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100001011111101

Octal: 141375

Duodecimal: 24A79

Hexadecimal: c2fd

Square: 2491706889

Square Root: 223.42112702249088

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

Composites whose prime factorization in base 8 is an anagram of the number in base 8. A260052

Number of 5X2 integer matrices with each row summing to zero, row elements in nondecreasing order, rows in lexicographically nondecreasing order, and the sum of squares of the elements <= 2·n² (number of collections of 5 zero-sum 2-vectors with total modulus squared not more than 2·n², ignoring vector and component permutations). A192705

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

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

Number of (n+1) X (7+1) 0..3 arrays with the minimum plus the upper median equal to the lower median plus the maximum in every 2 X 2 subblock. A235892