Properties of the Number 22955

Twenty-Two Thousand Nine Hundred Fifty-Five

Basics

Value: 22954 → 22955 → 22956

Parity: odd

Prime: No

Previous Prime: 22943

Next Prime: 22961

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 5 × 4591

Divisors: 1, 5, 4591, 22955

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101100110101011

Octal: 54653

Duodecimal: 1134B

Hexadecimal: 59ab

Square: 526932025

Square Root: 151.50907563575194

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

T(n,k)=Number of length (n+k)X1 arrays of occupancy after each element moves up to +-k places but not 0 and without 2-loops. A222165

Ooguri-Vafa invariants of disk degeneracies for brane I or brane II in the O(K) -> P² geometry. A61636

Triangle read by rows: T(n,k) (n,k>=0) = number of peakless Motzkin paths of length n having k valleys (i.e., (1,-1) followed by (1,1)) at level zero (can be easily translated into RNA secondary structure terminology). A110333

Total sum of parts of multiplicity 6 in all partitions of n. A222734

Non-Brauer numbers. A349044

Expansion of g.f. A(x) = ∏_n>=1 (1 + x^n-1 + x^2·n-1) * (1 + xⁿ + x^2·n-1) * (1 - xⁿ - x^2·n). A370541

Number of (n+6)X1 arrays of occupancy after each element moves up to +-6 places but not 0 and without 2-loops. A222164

Unique increasing sequence satisfying a(n) = a(n-3) + c(n-3); where c( ) is complement of a( ). A22955

Number of length n+4 0..5 arrays with no five consecutive elements with pattern ababa or abbba (possibly a=b) and new values 0..5 introduced in 0..5 order. A244180