Properties of the Number -55567

Fifty-Five Thousand Five Hundred Sixty-Seven

Basics

Value: -55568 → -55567 → -55566

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 181 × 307

Divisors: 1, 181, 307, 55567

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1101100100001111

Octal: -154417

Duodecimal: -281A7

Hexadecimal: -d90f

Square: 3087691489

Square Root: 235.7265364781827

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

Square array T(n,k), n >= 1, k >= 1, read by antidiagonals, where column k is the expansion of e.g.f. -log(1 - f^k-1(x)), where f(x) = log(1+x). A351420

Expansion of e.g.f. -log(1 - log(1 + log(1+x))). A351421

Number of compositions [p(1), p(2), ..., p(k)] of n such that p(j) <= 2·p(j-1) and p(j-1) <= 2·p(j). A224957

T(n,k)=Number of nXk 0..4 arrays with each element·equal to the number of its horizontal and vertical neighbors equal to 4,0,1,1,1 for x=0,1,2,3,4. A197431

G.f.: q-cosh(x) evaluated at q=-x. A198201

Composite numbers k such that k-1 divides 2^k-2. A330382

a(n) = 6n³ + 1, solution z in Diophantine equation x³ + y³ = z³ - 2. It may be considered a Fermat near miss by 2. A163827

Number of nX3 0..4 arrays with each element·equal to the number its horizontal and vertical neighbors equal to 4,0,1,1,1 for x=0,1,2,3,4. A197426

Number of nX7 0..4 arrays with each element·equal to the number its horizontal and vertical neighbors equal to 4,0,1,1,1 for x=0,1,2,3,4. A197430