Properties of the Number 54954

Fifty-Four Thousand Nine Hundred Fifty-Four

Basics

Value: 54953 → 54954 → 54955

Parity: even

Prime: No

Previous Prime: 54949

Next Prime: 54959

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 43 × 71

Divisors: 1, 2, 3, 6, 9, 18, 43, 71, 86, 129

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101011010101010

Octal: 153252

Duodecimal: 27976

Hexadecimal: d6aa

Square: 3019942116

Square Root: 234.42269514703563

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 rooted tandem duplication trees on n gene segments. A264868

Triangular array: For n >= 2 and 0 <= k <= n - 2, T(n, k) equals the number of rooted duplication trees on n gene segments whose leftmost visible duplication event is (k, r), for 1 <= r <= (n - k)/2. A264869

Map from binary trees of size n to the set of corresponding trivalent plane trees (tpt) represented as size 2n+1 general trees. A83930

Number of finite, negative, Archimedean, totally ordered monoids of size n (semi-groups with a neutral element that is also the top element). A253949

G.f. B(x) satisfies: B(x) = 1/((1-x·A(x))*(1-x·C(x)³)) such that A(x) = 1/((1-x·B(x)²)*(1-x·C(x)³)) and C(x) = 1/((1-x·A(x))*(1-x·B(x)²)) are the g.f.s of A341954 and A341956, respectively. A341955

a(n) = least solution k of f(k) = f(k-1) + ... + f(k-n), where f(m) = prime(m+1)-prime(m) and prime(m) denotes the m-th prime, if k exists; 0 otherwise. A66496

p(11p-7) where p is prime. A98998

Number of permutations of [n] avoiding the generalized patterns 1(k+2)-(u₁+1)-...-(u_k+1) for all permutations u of [k]. A263791

Number of ways to choose 4 disjoint subsets of {1..n} with the same sum and with respectively 1, 2, 3 and 4 distinct elements of {1..n}. A363517

Number of unlabeled semi-strong digraphs on n nodes with an even number of pairwise different components. A54954