Properties of the Number 55730

Fifty-Five Thousand Seven Hundred Thirty

Basics

Value: 55729 → 55730 → 55731

Parity: even

Prime: No

Previous Prime: 55721

Next Prime: 55733

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 × 5 × 5573

Divisors: 1, 2, 5, 10, 5573, 11146, 27865, 55730

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101100110110010

Octal: 154662

Duodecimal: 28302

Hexadecimal: d9b2

Square: 3105832900

Square Root: 236.07202290826416

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 read by rows: T(n,k) is the number of non-isomorphic multiset partitions of weight n with k parts and no singletons or vertices that appear only once, 0 <= k <= floor(n/2). A369287

Number of (n+2) X (5+2) 0..1 arrays with no 3·3 subblock diagonal sum 0 and no antidiagonal sum 3 and no row sum 1 and no column sum 1. A257444

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 577", based on the 5-celled von Neumann neighborhood. A273024

Number of nX6 0..1 arrays with every element equal to 0, 1 or 3 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A302161

A triangular sequence of coefficients of the expansion of a Green's function for the radial Morse potential with·being the kinetic energy and t being the radius: Hamiltonian; H=K+V=x+Exp[-2·t]-2·Exp[t];G·Exp[t·x)=Exp[x·t]/(t-H); p(t,x)=Exp[t·x]/(t-x-Exp[-2·t] + 2·Exp[-t]). A138160

a(n) is the number of triangular partitions whose Young diagram fits inside a square of side n. A368638

Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) for n >= 3 with a(0) = a(1) = 0 and a(2) = 1. A73

Tetranacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4) for n >= 4 with a(0) = a(1) = a(2) = 0 and a(3) = 1. A78

Pentanacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4) + a(n-5), a(0)=a(1)=a(2)=a(3)=0, a(4)=1. A1591

Number of primes <= 5ⁿ. A55730