Properties of the Number 49848

Forty-Nine Thousand Eight Hundred Forty-Eight

Basics

Value: 49847 → 49848 → 49849

Parity: even

Prime: No

Previous Prime: 49843

Next Prime: 49853

Digit Sum: 33

Digital Root: 6

Palindrome: No

Factorization: 2 ³ × 3 × 31 × 67

Divisors: 1, 2, 3, 4, 6, 8, 12, 24, 31, 62

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 1100001010111000

Octal: 141270

Duodecimal: 24A20

Hexadecimal: c2b8

Square: 2484823104

Square Root: 223.26665671344657

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

T(n,k) = number of defective 3-colorings of an n X k 0..2 array connected horizontally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order. A229586

Numbers n such that every digit of n and n-th prime contains a loop (only digits 0,4,6,8,9 in n and n-th prime). A107624

Number of 3 X 3 X 3 triangular nonnegative integer arrays with all sums of an element and its neighbors <= n. A166189

Solution of the complementary equation a(n) = a(n-1) + a(n-2) + n·b(n), where a(0) = 2, a(1) = 4, b(0) = 1, b(1) = 3, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences. A296297

Nonnegative values·of solutions (x, y) to the Diophantine equation x² + (x+84847)² = y². A201917

Number of defective 3-colorings of an n X 6 0..2 array connected horizontally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order. A229584

Number of defective 3-colorings of a 3 X n 0..2 array connected horizontally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order. A229588

∑_i=1..n ∑_j=1..n (i OR j), where OR is the binary logical OR operator. A258438

Number of nXnXn triangular nonnegative integer arrays with all sums of an element and its neighbors <= 14. A166186

Irregular table read by rows: T(n,k) is the number of k-gons, k>=2, among all distinct circles that can be constructed from an n·n square grid of points when each pair of points is connected by a circle and the points lie at the ends of a diameter of the circle. A360354