Properties of the Number 2164

Two Thousand One Hundred Sixty-Four

Basics

Value: 2163 → 2164 → 2165

Parity: even

Prime: No

Previous Prime: 2161

Next Prime: 2179

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 541

Divisors: 1, 2, 4, 541, 1082, 2164

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 100001110100

Octal: 4164

Duodecimal: 1304

Hexadecimal: 874

Square: 4682896

Square Root: 46.51881339845203

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 partitions of n into distinct parts >= 2. A25147

a(n) = n² + n + 2. A14206

Number of partitions of 2n in which every part is <n+1; also, the number of partitions of 2 into rational numbers a/b such that 0<a<=b<=n and b divides n. A209816

Numbers k such that k⁶⁴ + 1 is prime. A6316

Number of partitions of n into distinct parts, the least being 1. A96765

Number of partitions of n with no part larger than n/2. Also partitions of n into n/2 or fewer parts. A110618

E-toothpick sequence (see Comments lines for definition). A161328

Number of integer partitions of n whose greatest part is at most one more than the sum of the other parts. A336106

Number of ON states after n generations of cellular automaton based on triangles. A161644

Triangle, T(n, k): T(n,k) = 1 for n < 3, T(3,1) = T(3,2) = T(3,3) = 2, T(n,0) = 1, T(n,1) = n-1, T(n,n) = T(n-1,n-2) + T(n-1,n-1), otherwise T(n,k) = T(n-1,k-2) + T(n-1,k-1) + T(n-1,k), read by rows. A26268