Properties of the Number 36260

Thirty-Six Thousand Two Hundred Sixty

Basics

Value: 36259 → 36260 → 36261

Parity: even

Prime: No

Previous Prime: 36251

Next Prime: 36263

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ² × 5 × 7 ² × 37

Divisors: 1, 2, 4, 5, 7, 10, 14, 20, 28, 35

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1000110110100100

Octal: 106644

Duodecimal: 18B98

Hexadecimal: 8da4

Square: 1314787600

Square Root: 190.4205871222962

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 polyforms with n cells on the faces of a deltoidal icositetrahedron up to rotation. A383805

Irregular triangle read by rows: Whitney numbers of the second kind a(n,k), n >= 1, k >= 0, for the star poset. A7799

Numbers n which when converted to base 6, reversed and converted back to base 10 yield a number m such that n mod m = 0. Cases which are trivial or result in digit loss are excluded. A91080

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays colored with the maximum plus the upper median plus the minimum minus the lower median of every 2X2 subblock. A236780

Number of ways to place 3 nonattacking nightriders on a 3 X n board. A172218

Number of 6-cycles in the n-triangular graph. A290940

Expansion of ∑_i>=1 x^i² / (1 - ∑_j>=1 x^j²)². A281704

Number of (n+1)X(2+1) 0..2 arrays colored with the maximum plus the upper median plus the minimum minus the lower median of every 2X2 subblock. A236776

Number of (n+1)X(3+1) 0..2 arrays colored with the maximum plus the upper median plus the minimum minus the lower median of every 2X2 subblock. A236777

a(1) = a(2) = 2; a(n) = a(n-1) + gpf(a(n-2)), where gpf is greatest prime factor. A258125