Properties of the Number -27071

Twenty-Seven Thousand Seventy-One

Basics

Value: -27072 → -27071 → -27070

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 11 × 23 × 107

Divisors: 1, 11, 23, 107, 253, 1177, 2461, 27071

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -110100110111111

Octal: -64677

Duodecimal: -137BB

Hexadecimal: -69bf

Square: 732839041

Square Root: 164.5326715275723

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

Odd composite integers m such that F(m)² == 1 (mod m), where F(m) is the m-th Fibonacci number. A337231

Composite n coprime to 5 such that Fibonacci(n) == Legendre(n,5) (mod n). A49062

Odd composites m that divide Fibonacci(m)-1. A94394

For n>0, a(n) is the least quasi-Carmichael number to base -n, extended to n=0 with the least composite squarefree integer. A29591

Odd n dividing Fibonacci(n)-1 but neither Fibonacci(n-1) nor Fibonacci(n+1). A94400

Composite k such that Fibonacci(k) == Legendre(k,5) == 1 (mod k). A93372

Odd numbers k that divide Fibonacci(k) - 1 but not Fibonacci(k-1). A94409

Least integer k > 1 such that π(k)² + π(k·n)² is a square, where π(.) is the prime-counting function given by A000720. A255677

Numbers k such that Fibonacci(k) == +-1 (mod k) and k is neither 1 nor prime nor twice a prime. A279072

a(n) is the number of squares of side length greater than 1 having vertices at the points of an n X n grid of dots. A328152