Properties of the Number 4811

Four Thousand Eight Hundred Eleven

Basics

Value: 4810 → 4811 → 4812

Parity: odd

Prime: No

Previous Prime: 4801

Next Prime: 4813

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 17 × 283

Divisors: 1, 17, 283, 4811

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 1001011001011

Octal: 11313

Duodecimal: 294B

Hexadecimal: 12cb

Square: 23145721

Square Root: 69.36137253543934

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 partitions of n with even minimal and maximal parts. A325346

Array read by antidiagonals: T(m,n) is the number of independent sets in the stacked prism graph C_m X P_n. A286513

Expansion of ∏_{r = 1 or not a perfect power} 1/(1 - x^r). A305630

a(n) is the least number of prime factors for any abundant number with p_n (the n-th prime) as its least factor. A108227

Number of times prime(n) (the n-th prime) occurs as the least prime factor among numbers 1 .. (prime(n)² * prime(n+1)): a(n) = A078898(A251720(n)). A250477

Triangle read by rows, T(n,k) = (2^k-1) * T(n-1,k) + T(n-1,k-1). A139382

Consider a number x. Take the sum of its digits. Repeat the process deleting the first addendum and adding the previous sum. The sequence lists the numbers that after some iterations reach the arithmetic derivative of x. A269312

T(n,k)=Number of nXk 0..1 arrays with every element unequal to 1, 2, 3, 4, 6, 7 or 8 king-move adjacent elements, with upper left element zero. A317376

Expansion of 1/((1-x)*(1-3·x)*(1-7·x)). A16212

Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths incorporating each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 3, n >= 2. A214504