Properties of the Number 36045

Thirty-Six Thousand Forty-Five

Basics

Value: 36044 → 36045 → 36046

Parity: odd

Prime: No

Previous Prime: 36037

Next Prime: 36061

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ⁴ × 5 × 89

Divisors: 1, 3, 5, 9, 15, 27, 45, 81, 89, 135

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1000110011001101

Octal: 106315

Duodecimal: 18A39

Hexadecimal: 8ccd

Square: 1299242025

Square Root: 189.85520798756087

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 ways to tile an n X n X n triangular area with two 2 X 2 X 2 triangular tiles and an appropriate number (= n²-8) of 1 X 1 X 1 tiles. A286437

Triangular sequence produced from symmetrical power of two matrices of the general type: M={{1, 2, 4, 8}, {2, 1, 2, 4}, {4, 2, 1, 2}, {8, 4, 2, 1}}. A129964

Bell or exponential numbers: number of ways to partition a set of n labeled elements. A110

Sierpiński's [Sierpinski's] triangle (or gasket): triangle, read by rows, formed by reading Pascal's triangle (A007318) mod 2. A47999

The ternary tribonacci word; also a Rauzy fractal sequence: fixed point of the morphism 1 -> 12, 2 -> 13, 3 -> 1, starting from a(1) = 1. A92782

Reve's puzzle: number of moves needed to solve the Towers of Hanoi puzzle with 4 pegs and n disks, according to the Frame-Stewart algorithm. A7664

Sum of distances between dual pairs of partitions of n for the canonical order. A36045

Fixed point of the morphism 1 -> 12, 2 -> 31, 3 -> 1, starting from a(1) = 1. A100619

Unique fixed point of the morphism 0 -> 01, 1 -> 20, 2 -> 0. A277735

Square array read by antidiagonals: T(n,k) is the number of relations between set A with n elements and set B with k elements that are both right unique and left unique. A329655