Properties of the Number 4501

Four Thousand Five Hundred One

Basics

Value: 4500 → 4501 → 4502

Parity: odd

Prime: No

Previous Prime: 4493

Next Prime: 4507

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 7 × 643

Divisors: 1, 7, 643, 4501

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1000110010101

Octal: 10625

Duodecimal: 2731

Hexadecimal: 1195

Square: 20259001

Square Root: 67.08949247087803

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 integer partitions of n whose product of parts is >= n. A319005

Number of partitions satisfying 0 < cn(0,5) + cn(1,5) + cn(4,5). A39900

Number of 3-level labeled linear rooted trees with n leaves. A50351

Number T(n,k) of sequences in {1,...,n}ⁿ with longest increasing subsequence of length k; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A245667

T(n,k)=Number of arrays of n integers in -k..k with sum zero and equal numbers of elements greater than zero and less than zero. A201811

E.g.f.: exp(7·x*G(x)⁶) / G(x)⁶ where G(x) = 1 + x·G(x)⁷ is the g.f. of A002296. A251577

T(n,k)=number of distinct solutions of sum{i=1..k}(x(2i-1)*x(2i)) = 1 (mod n), with x() in 0..n-1. A180813

Triangle read by rows, s₄(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0. A225471

T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with no element unequal to a strict majority of its horizontal, vertical, diagonal and antidiagonal neighbors, with values 0..2 introduced in row major order. A231227

Sum of the squarefree parts of the partitions of n into 7 parts. A309482