Properties of the Number 36192

Thirty-Six Thousand One Hundred Ninety-Two

Basics

Value: 36191 → 36192 → 36193

Parity: even

Prime: No

Previous Prime: 36191

Next Prime: 36209

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ⁵ × 3 × 13 × 29

Divisors: 1, 2, 3, 4, 6, 8, 12, 13, 16, 24

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000110101100000

Octal: 106540

Duodecimal: 18B40

Hexadecimal: 8d60

Square: 1309860864

Square Root: 190.24195120950583

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 asymmetric trees with n nodes (also called identity trees). A220

Shifts 2 places left under Dirichlet convolution. A144366

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

a(n) = 27·n² - 21·n + 6 (n>=1). A304164

a(n) is the number of multisets of n decimal digits where the sum of the digits equals the product of the prime digits. A384445

a(n) = 4*(n - 1)*(16·n - 23) for n >= 1. A304378

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

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

Triangle T(n,m) read by rows: ∑_k=1..m binomial(2·n, n+k)*d(k), m<=n, with d(k)=A000005(k). A351145

E.g.f. satisfies: A(x) = 1/(1 - tan( x·A(x) )). A201594