Properties of the Number 22854

Twenty-Two Thousand Eight Hundred Fifty-Four

Basics

Value: 22853 → 22854 → 22855

Parity: even

Prime: No

Previous Prime: 22853

Next Prime: 22859

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 13 × 293

Divisors: 1, 2, 3, 6, 13, 26, 39, 78, 293, 586

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101100101000110

Octal: 54506

Duodecimal: 11286

Hexadecimal: 5946

Square: 522305316

Square Root: 151.17539482336403

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 permutations p of 1,2,...,n satisfying |p(i+1)-p(i)|<>3 and |p(j+3)-p(j)|<>1 for all i=1..n-1, j=1..n-3. A189358

Number of partitions of n into parts having at most two prime-factors. A101049

Expansion of (x²)/((1-x)*(1-2·x-x²+x³)²). A189427

Records in A087669. A192230

a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2·n - 3 - 2^p+1 and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1 and a(2) = a(3) = 3. A49972

Define a(1)=1. Thereafter a(n) is the smallest positive integer with the property that a(n)² cannot be created by summing the squares of at most n values chosen among the previous terms (with repeats allowed). A111302

a(n) = [ a(n-1)/a(1) + a(n-1)/a(2) + ... + a(n-1)/a(n-1) ] for n >= 3, with initial terms 1,1. A22854

Array read by antidiagonals: Costs E[m,N] of m-ary Huffman trees of maximum height with N internal nodes (non-leaves) for minimizing absolutely ordered sequences of size n=2N+1; m > 1, N > 0. A98810