Properties of the Number 36057

Thirty-Six Thousand Fifty-Seven

Basics

Value: 36056 → 36057 → 36058

Parity: odd

Prime: No

Previous Prime: 36037

Next Prime: 36061

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 7 × 17 × 101

Divisors: 1, 3, 7, 17, 21, 51, 101, 119, 303, 357

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000110011011001

Octal: 106331

Duodecimal: 18A49

Hexadecimal: 8cd9

Square: 1300107249

Square Root: 189.88680838857658

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 (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having one, three or four distinct clockwise edge differences. A209960

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum prime and every diagonal and antidiagonal sum nonprime. A251950

a(n)=n*(a(n-1)-3), a(0)=1. A165814

Number of (n+1) X 2 0..2 arrays with every 2 X 2 subblock having one, three or four distinct clockwise edge differences. A209953

Number of (n+1)X5 0..2 arrays with every 2X2 subblock having one, three or four distinct clockwise edge differences. A209956

Number of (n+2)X(1+2) 0..3 arrays with every 3X3 subblock row and column sum prime and every diagonal and antidiagonal sum nonprime. A251943

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, -1, 0), (-1, 1, 0), (1, 0, 0), (1, 1, 1)}. A150680

Friedman numbers: can be written in a nontrivial way using their digits and the operations + - * / ^ and concatenation of digits (but not of results). A36057