Properties of the Number 22991

Twenty-Two Thousand Nine Hundred Ninety-One

Basics

Value: 22990 → 22991 → 22992

Parity: odd

Prime: No

Previous Prime: 22973

Next Prime: 22993

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 83 × 277

Divisors: 1, 83, 277, 22991

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101100111001111

Octal: 54717

Duodecimal: 1137B

Hexadecimal: 59cf

Square: 528586081

Square Root: 151.6278338564526

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

Schoenheim bound L₁(n,5,4). A36832

Ulam's spiral (NNE spoke). A143861

The number of 5-alternating permutations of [n]. A250260

Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 12 (most significant digit on right). A61965

Nearest integer to log(nⁿ)^{1 + log(log(1 + n})). A62480

a(1)=1, a(2)=2, a(n)=a(n-1)+floor(a(n-2)*a(n-1)/(a(n-2)+a(n-1))). A173090

s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = A001950 (upper Wythoff sequence). A24594

s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = A001950 (upper Wythoff sequence). A25108

T(n,n), array T as in A047030. A47032

Composite numbers k = concat(x,LSD(k)) such that the sum of the aliquot parts of k is equal to the sum of the aliquot parts of x. A293480