Properties of the Number -27001

Twenty-Seven Thousand One

Basics

Value: -27002 → -27001 → -27000

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 13 × 31 × 67

Divisors: 1, 13, 31, 67, 403, 871, 2077, 27001

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -110100101111001

Octal: -64571

Duodecimal: -13761

Hexadecimal: -6979

Square: 729054001

Square Root: 164.3198101264726

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) = n³ + 1. A1093

T(n,k) = Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or vertical neighbor in a random 0..1 n X k array. A218354

T(n,k)=Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, diagonal or antidiagonal neighbor in a random 0..1 nXk array. A219078

Numbers k such that k¹⁴ == 1 (mod 15³). A56087

a(n) = 30·n² + 1. A158558

A239461(n) / n². A239464

Array read by antidiagonals: T(m,n) = number of dominating sets in the stacked prism graph C_m X P_n. A286514

Hilltop maps: number of n X 2 binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or vertical neighbor in a random 0..1 nX2 array. A218348

Odd numbers m such that σ(x) = m has more than 1 solution. A300869

Number of (i,j,k) in {1,2,...,n}³ such that gcd(n,i) = gcd(n,j) = gcd(n,k). A338997