Properties of the Number 2165

Two Thousand One Hundred Sixty-Five

Basics

Value: 2164 → 2165 → 2166

Parity: odd

Prime: No

Previous Prime: 2161

Next Prime: 2179

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 5 × 433

Divisors: 1, 5, 433, 2165

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 100001110101

Octal: 4165

Duodecimal: 1305

Hexadecimal: 875

Square: 4687225

Square Root: 46.52956049652737

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

Coordination sequence for "hal" 3D uniform tiling. A299274

a(n) = largest number of distinct words arising in Post's tag system {00, 1101} applied to a binary word w, over all starting words w of length n, or a(n) = -1 if there is a word w with an unbounded trajectory. A284116

a(n) = n² + n + 3. A27688

a(n) = 6·n² - 1. A140811

T(n,k)=Number of nXk 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of the elements above it, modulo 4. A239405

5-Knödel numbers. A50993

Numbers k > 1 such that, in base 4, k and k² contain the same digits in the same proportion. A61658

a(n) = Frobenius number for 8 successive primes = F[p(n), p(n+1), p(n+2), p(n+3), p(n+4), p(n+5), p(n+6), p(n+7)]. A138994

Column 2 of array in A144502. A144498

Number of ways to write n as an ordered sum of 5 primes. A340961