Properties of the Number 39480

Thirty-Nine Thousand Four Hundred Eighty

Basics

Value: 39479 → 39480 → 39481

Parity: even

Prime: No

Previous Prime: 39461

Next Prime: 39499

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 ³ × 3 × 5 × 7 × 47

Divisors: 1, 2, 3, 4, 5, 6, 7, 8, 10, 12

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1001101000111000

Octal: 115070

Duodecimal: 1AA20

Hexadecimal: 9a38

Square: 1558670400

Square Root: 198.69574731231668

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 permutations of the multiset {1,1,2,2,...,n,n} with no two consecutive terms equal. A114938

Amicable triples: numbers such that σ(x) = σ(y) = σ(z) = x+y+z, x<y<z. We order these triples according to the common value of σ. Sequence gives·numbers. A125490

Square array A(n,k), n >= 1, k >= 1, read by antidiagonals, where A(n,k) is the number of permutations of n copies of 1..k with no element equal to another within a distance of 1. A322093

T(n,k)=4X4 square grid graph coloring a rectangular array: number of nXk 0..15 arrays where 0..15 label nodes of the square grid graph and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223402

Numbers n such that the multiplicative group modulo n is the direct product of 6 cyclic groups. A272596

Expansion of ∏_k>=1 (1 + 5·x^k). A261569

Numbers with prime factorization pqrst³. A189984

Numbers n such that {largest m such that 1, 2, ..., m divide n} is different from {largest m such that m! divides n²}. A232099

Number T(n,k) of set partitions of [n] such that at least one of the block sizes is k or k=0; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A327884

Maximal length of rook tour on an n X n+4 board. A152135