Properties of the Number -271442

Two Hundred Seventy-One Thousand Four Hundred Forty-Two

Basics

Value: -271443 → -271442 → -271441

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 × 135721

Divisors: 1, 2, 135721, 271442

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -1000010010001010010

Octal: -1022122

Duodecimal: -111102

Hexadecimal: -42452

Square: 73680759364

Square Root: 521.0009596920144

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

a(n) = a(n-1) + a(n-2) + 1, with a(0) = 0 and a(1) = 2. A1610

a(n) = floor(φⁿ), where φ = (1+sqrt(5))/2 is the golden ratio. A14217

Numbers k that have 13 terms in their Zeckendorf representation. A179253

a(n) = Fibonacci(n-1) + Fibonacci(n+1) - (-1)ⁿ. A98600

Number of cyclic binary n-bit strings with no alternating substring of length > 2. A7039

a(n) = F(2n+1) + F(2n-1) - 1. A5592

Number of (marked) cyclic n-bit binary strings containing no runs of length > 2. A7040

a(n) = 5·F(n)² + 3*(-1)ⁿ where F(n) are the Fibonacci numbers A000045. A47946

Number of nonempty subsets of {1, ..., n} containing no two cyclically successive elements. A324015

a(n) = A000045(A032742(n)) / A000045(A054576(n)), where A000045(n) gives the n-th Fibonacci number, A032742(n) = the largest proper divisor of n, and A054576(n) = A032742(A032742(n)). A280689