Properties of the Number 2136

Two Thousand One Hundred Thirty-Six

Basics

Value: 2135 → 2136 → 2137

Parity: even

Prime: No

Previous Prime: 2131

Next Prime: 2137

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 ³ × 3 × 89

Divisors: 1, 2, 3, 4, 6, 8, 12, 24, 89, 178

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 100001011000

Octal: 4130

Duodecimal: 12A0

Hexadecimal: 858

Square: 4562496

Square Root: 46.216880033165374

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

Triangle read by rows: T(n,m) (n >= m >= 1) = number of regions (or cells) formed by drawing the line segments connecting any two of the 2*(m+n) perimeter points of an m X n grid of squares. A331452

a(n) = ∑_{i=1..n, j=1..n, gcd(i,j)=1} (n+1-i)*(n+1-j). A115004

Number of graphical partitions of 2n. A569

a(n) = n·prime(n). A33286

Numbers k such that the k-th partition number A000041(k) is prime. A46063

Number of integer partitions of n that can be partitioned into sets with distinct sums. A381992

One of the two successive approximations up to 5ⁿ for the 5-adic integer sqrt(-4). These are the 1 mod 5 numbers, except for n = 0. A268922

Number of integer partitions of n whose mean is a mode, i.e., partitions whose mean appears at least as many times as each of the other parts. A363724

Number of 3-uniform hypergraphs on n unlabeled nodes, or equivalently number of relations with 3 arguments on n nodes. A665

Total number of parts in all partitions of n plus the sum of largest parts of all partitions of n. A211978