Properties of the Number 2169

Two Thousand One Hundred Sixty-Nine

Basics

Value: 2168 → 2169 → 2170

Parity: odd

Prime: No

Previous Prime: 2161

Next Prime: 2179

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 241

Divisors: 1, 3, 9, 241, 723, 2169

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 100001111001

Octal: 4171

Duodecimal: 1309

Hexadecimal: 879

Square: 4704561

Square Root: 46.57252408878007

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

Odd numbers of the form p^1+4k * r², where p is prime of the form 1+4m, r > 1, and gcd(p,r) = 1. (Euler's criteria for odd perfect numbers). A228058

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) = 2ⁿ + n². A1580

a(n) = 90·n - 81. A139280

a(1) = 1; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime. A33680

Leyland numbers: 3, together with numbers expressible as n^k + kⁿ nontrivially, i.e., n,k > 1 (to avoid n = (n-1)¹ + 1^n-1). A76980

Polar structured meta-anti-diamond numbers, the n-th number from a polar structured n-gonal anti-diamond number sequence. A100188

Number of 5-level labeled linear rooted trees with n leaves. A50353

Numbers that can be written as s^x + t^y, with 1 < s < t and {s,t} = {x,y}; that is, are of the form s^s + t^t or s^t + t^s. A385232

Number of ordered pairs (i,j) with |i| + |j| <= n and gcd(i,j) <= 1. A100449