Properties of the Number 55230

Fifty-Five Thousand Two Hundred Thirty

Basics

Value: 55229 → 55230 → 55231

Parity: even

Prime: No

Previous Prime: 55229

Next Prime: 55243

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 5 × 7 × 263

Divisors: 1, 2, 3, 5, 6, 7, 10, 14, 15, 21

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101011110111110

Octal: 153676

Duodecimal: 27B66

Hexadecimal: d7be

Square: 3050352900

Square Root: 235.0106380570888

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

Array read by antidiagonals: T(n,m) = number of Hamiltonian cycles in C_n X C_m. A270273

Numbers k having exactly 5 distinct prime factors, the largest of which is greater than or equal to sqrt(k) (i.e., sqrt(k)-rough numbers with exactly 5 distinct prime factors). A115959

Number of Hamiltonian cycles in C₄ X C_n. A216588

Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 94. A31772

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (0, 1, 0), (1, -1, -1), (1, 1, 0)}. A150063

Triangle, read by rows, defined by recurrence: T(n,k) = T(n-1,k-1) + (-1)^k * (2·k + 1) * T(n-1,k) for 0 < k < n with initial values T(n,0) = T(n,n) = 1 for n >= 0 and T(i,j) = 0 if j < 0 or j > i. A346083

Expansion of 1/((1-x) * (1+3·x) * (1-5·x) * (1+7·x) * (1-9·x)). A383648

Greatest common divisor of largest square dividing n! and squarefree part of n!. A55230

Table read by antidiagonals: Place k equally spaced points on each side of a regular n-gon and join every pair of these n·k points by a chord; T(n,k) (n >= 3, k >= 0) gives the number of edges in the resulting planar graph. A367305