Properties of the Number 60550

Sixty Thousand Five Hundred Fifty

Basics

Value: 60549 → 60550 → 60551

Parity: even

Prime: No

Previous Prime: 60539

Next Prime: 60589

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 5 ² × 7 × 173

Divisors: 1, 2, 5, 7, 10, 14, 25, 35, 50, 70

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1110110010000110

Octal: 166206

Duodecimal: 2B05A

Hexadecimal: ec86

Square: 3666302500

Square Root: 246.06909598728566

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

T(n,k)=Number of nXk 0..3 arrays with no more than floor(nXk/2) elements unequal to at least one horizontal, vertical or antidiagonal neighbor, with new values introduced in row major 0..3 order. A222616

Number of subsets of {1,...,n + 1} containing n + 1 and such that all positive differences of distinct elements are distinct. A308251

Number of partitions p of n such that the m(M(p)) is a part, where m = multiplicity, M = the minimum multiplicity of the parts of p. A240539

Triangle T(n,k) read by rows: coefficients of polynomials P_n(t) defined in Formula section. A286796

Number of nX5 0..3 arrays with no more than floor(nX5/2) elements unequal to at least one horizontal, vertical or antidiagonal neighbor, with new values introduced in row major 0..3 order. A222613

Number of minors in the n-sunlet graph. A354671

a(n) is the number of distinct patterns (modulo geometric D₃-operations) with no other than strict 120-degree rotational symmetry which can be formed by an equilateral triangular arrangement of closely packed black and white cells satisfying the local matching rule of Pascal's triangle modulo 2, where n is the number of cells in each edge of the arrangement. A60550

Number of nX5 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 0 1 0 vertically. A207771