Properties of the Number 53676

Fifty-Three Thousand Six Hundred Seventy-Six

Basics

Value: 53675 → 53676 → 53677

Parity: even

Prime: No

Previous Prime: 53657

Next Prime: 53681

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ³ × 7 × 71

Divisors: 1, 2, 3, 4, 6, 7, 9, 12, 14, 18

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101000110101100

Octal: 150654

Duodecimal: 27090

Hexadecimal: d1ac

Square: 2881112976

Square Root: 231.68081491569387

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

Triangle of coefficients in expansion of (x+1)*(x+3)*...*(x + 2n - 1) in rising powers of x. A28338

Triangle of coefficients in expansion of (x-1)*(x-3)*(x-5)*...*(x-(2·n-1)). A39757

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 y numbers. A125491

Triangle of B-analogs of Stirling numbers of first kind. A39758

a(n) = 3rd elementary symmetric function of the first n+2 odd positive integers. A24197

Number of rooted trees with n nodes with every leaf at height 10. A48815

Number of partitions of n into parts of 18 kinds. A23016

A005117(k) - 1 where k is the least k such that A389412(k) = n. A389879

Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and having height of last peak equal to k. A109158

Let Oc(n) = A005900(n) = n-th octahedral number. Consider all integer triples (i,j,k), j >= k > 0, with Oc(i) = Oc(j)+Oc(k), ordered by increasing i; sequence gives i values. A53676