Properties of the Number 4850

Four Thousand Eight Hundred Fifty

Basics

Value: 4849 → 4850 → 4851

Parity: even

Prime: No

Previous Prime: 4831

Next Prime: 4861

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 5 ² × 97

Divisors: 1, 2, 5, 10, 25, 50, 97, 194, 485, 970

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1001011110010

Octal: 11362

Duodecimal: 2982

Hexadecimal: 12f2

Square: 23522500

Square Root: 69.6419413859206

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

Wedderburn-Etherington numbers: unlabeled binary rooted trees (every node has outdegree 0 or 2) with n endpoints (and 2n-1 nodes in all). A1190

Generalized 17-gonal (or heptadecagonal) numbers: m*(15·m - 13)/2 with m = 0, +1, -1, +2, -2, +3, -3, ... A303305

A B₂ sequence: a(n) is the least value such that sequence increases and pairwise sums of elements are all distinct. A25582

a(n) = 2·n*(4·n-3). A139271

T(n,k) = Number of n X k 0..1 arrays with the number of 1's horizontally, diagonally or antidiagonally adjacent to some 0 one less than the number of 0's adjacent to some 1. A285750

This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of binomial coefficients C(n,6). The p-th row (p>=1) contains a(i,p) for i=1 to 6·p-5, where a(i,p) satisfies ∑_i=1..n C(i+5,6)^p = 7·C(n+6,7) * ∑_i=1..6·p-5 a(i,p) * C(n-1,i-1)/(i+6). A87110

T(n,k)=Number of nXk 0..1 arrays with no more than floor(nXk/2) elements unequal to at least one horizontal, vertical or antidiagonal neighbor, with new values introduced in row major 0..1 order. A222635

Numbers that are the sum of six fourth powers in three or more ways. A345560

Numbers that are the sum of six fourth powers in exactly three ways. A345815

Number of n-node rooted unlabeled trees with outdegree <= 2 and exactly 1 edge at the root. A36656