Properties of the Number 4480

Four Thousand Four Hundred Eighty

Basics

Value: 4479 → 4480 → 4481

Parity: even

Prime: No

Previous Prime: 4463

Next Prime: 4481

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ⁷ × 5 × 7

Divisors: 1, 2, 4, 5, 7, 8, 10, 14, 16, 20

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1000110000000

Octal: 10600

Duodecimal: 2714

Hexadecimal: 1180

Square: 20070400

Square Root: 66.93280212272605

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

Sextuple factorials, 6-factorials, n!!!!!!, n!6. A85158

Numbers that are divisible by exactly 9 primes with multiplicity. A46312

Numbers that are the sum of 7 positive 6th powers. A3363

Triangle read by rows: terms T(n,k) of a binomial decomposition of n*(-1)ⁿ as Sum(k=0..n)T(n,k). A244141

If X₁, ..., X_n is a partition of a 2n-set X into 2-blocks then a(n) is equal to the number of 3-subsets of X containing none of X_i, (i=1,...,n). A130809

Sextuple factorial numbers: a(n) = ∏_k=0..n-1 (6·k+2). A47657

Triangle whose (i,j)-th entry is binomial(i,j)*2ⁱ. A38208

Let a,b,c,...k be all divisors of n; a(n) = (a+1)*(b+1)*...*(k+1). A20696

Number of ways of writing n as a sum of 16 squares. A152

Triangle read by rows: T(n,k) is the number of permutations of an n-set having k cycles of size > 1 (0<=k<=floor(n/2)). A136394