Properties of the Number 22169

Twenty-Two Thousand One Hundred Sixty-Nine

Basics

Value: 22168 → 22169 → 22170

Parity: odd

Prime: No

Previous Prime: 22159

Next Prime: 22171

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 7 × 3167

Divisors: 1, 7, 3167, 22169

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101011010011001

Octal: 53231

Duodecimal: 109B5

Hexadecimal: 5699

Square: 491464561

Square Root: 148.89257872708095

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

Least non-balanced x (i.e., not in A020492) such that σ(p(n),x)/φ(x) is an integer, where p(n) = n-th prime. A78540

Number of partitions of n into parts not of the form 17k, 17k+8 or 17k-8. Also number of partitions with at most 7 parts of size 1 and differences between parts at distance 7 are greater than 1. A35969

Number of rooted identity trees with n nodes and exactly 5 subtrees from the root. A227809

a(n) = ∑_i=1..n ∑_j=1..n ∑_k=1..n φ(i·j*k) / φ(j·k). A372663

First time n appears in the first differences of n·log(n): A217865. A217976

Triangle of Gaussian binomial coefficients [ n,k ] for q = 5. A22169

Triangle read by rows: T(n,k) is the minimum number of pairwise comparisons needed (in the worst case) to determine the k-th largest of n distinct numbers, for 1 <= k <= n. A360495

a(n) = ∑_k=0..n (-1)^k * binomial(3·n+2·k+1,n-k). A390544

Number of nX5 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 1 0 and 1 0 1 vertically. A207855