Properties of the Number 22954

Twenty-Two Thousand Nine Hundred Fifty-Four

Basics

Value: 22953 → 22954 → 22955

Parity: even

Prime: No

Previous Prime: 22943

Next Prime: 22961

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 × 23 × 499

Divisors: 1, 2, 23, 46, 499, 998, 11477, 22954

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101100110101010

Octal: 54652

Duodecimal: 1134A

Hexadecimal: 59aa

Square: 526886116

Square Root: 151.50577546747186

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

Matrix inverse, read by rows, of triangle A104029, which forms the pairwise sums of trinomial coefficients. A104030

Number of unrooted Eulerian n-edge maps in the plane (planar with a distinguished outside face). A103939

a(1) = 1, a(2) = 2; for n >= 2, a(n+1) = a(n) + sum of the unique prime factors of a(n). A96460

a(n) = prime(n) + n³ + n² + 4n - 1. A60822

Consider the smallest k such that prime(k) > n·composite(k). Sequence gives composite(k). A125075

G.f.: ∑_n>=1 xⁿ / (1-x)^prime(n). A227235

a(n) = ∑_{k=1..floor(n/2)} k * (n-k) * floor((n-k)/k). A339804

Numbers k such that the number of primes between k and 2k (inclusive) is equal to the number of primes between k and reverse(k) (inclusive). A74814

Numbers of ways in which a unit disc can be dissected into 6n curvilinear triangles, at least one of which does not contain the center. A193362

a(n) = a(n-1) + c(n+1) for n >= 3, a( ) increasing, given a(1)=1, a(2)=8; where c( ) is complement of a( ). A22954