Properties of the Number 36111

Thirty-Six Thousand One Hundred Eleven

Basics

Value: 36110 → 36111 → 36112

Parity: odd

Prime: No

Previous Prime: 36109

Next Prime: 36131

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 12037

Divisors: 1, 3, 12037, 36111

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000110100001111

Octal: 106417

Duodecimal: 18A93

Hexadecimal: 8d0f

Square: 1304004321

Square Root: 190.028945163625

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 nondecreasing partitions of n² into n parts from the intervals [1,n], [2,n+1], ..., [n,2n-1], respectively. A362967

a(n) = d(n-1) + d(n-2) + (n-1)[d(n-2) + 2d(n-3) + d(n-4)], where d(n), the derangement numbers, are given in A000166. (Let d(n) = 0 if n < 0.) A109742

Number of -4..4 arrays x(0..n-1) of n elements with zero sum and no element more than one greater than the previous. A199843

T(n,k)=Number of -k..k arrays x(0..n-1) of n elements with zero sum and no element more than one greater than the previous. A199847

a(n) is defined by the condition that the decimal expansion of ∑_n>0 1/a(n)ⁿ = 1/a(1)¹ + 1/a(2)² + 1/a(3)³ + ... begins with the concatenation of these numbers; also a(1) = 3 and a(n) > a(n-1). A324222

A summarize Fibonacci sequence starting with a(0)=2 and a(1)=3: summarize the previous two terms!. A36111