Properties of the Number -27022

Twenty-Seven Thousand Twenty-Two

Basics

Value: -27023 → -27022 → -27021

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 × 59 × 229

Divisors: 1, 2, 59, 118, 229, 458, 13511, 27022

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -110100110001110

Octal: -64616

Duodecimal: -1377A

Hexadecimal: -698e

Square: 730188484

Square Root: 164.38369748852836

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

Expansion of ∏_k>=1 1/(1+2·x^k). A71109

Numbers k such that 3^k - 8 is prime. A217135

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 0 and 1 1 1 vertically. A207346

a(n) is the number of terms in the expansion of (x+y+z)*(x²+y²+z²)*(x³+y³+z³)*...*(xⁿ+yⁿ+zⁿ). A86796

Expansion of ∏_k>=1 1/(1 - x^2·k+1)^2·k+1. A263199

Number of binary strings of length n with no substrings equal to 0000 0001 or 0011. A164408

Number of nX6 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 0 and 1 1 1 vertically. A207344

Number of 5Xn 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 0 and 1 1 1 vertically. A207349

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (1, 0, 1), (1, 1, 0), (1, 1, 1)}. A151215

Number of Largest Hairpin Family matchings on n edges. A256331