Properties of the Number -9027

Twenty-Seven

Basics

Value: -9028 → -9027 → -9026

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 17 × 59

Divisors: 1, 3, 9, 17, 51, 59, 153, 177, 531, 1003

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -10001101000011

Octal: -21503

Duodecimal: -5283

Hexadecimal: -2343

Square: 81486729

Square Root: 95.01052573267869

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

The r-th term of the n-th row of the following array contains the sum of r successively decreasing integers beginning from n, 0 < r <= n (see Example). A110426

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1 or 2 horizontally or antidiagonally adjacent elements, with upper left element zero. A301841

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero. A302069

Numbers that are the sum of seven fourth powers in four or more ways. A345570

Numbers that are the sum of seven fourth powers in exactly four ways. A345826

a(n) = 4·n*(n+1) + 3. A164897

a(n) = prime(n)*T(n), where T = A000217. A196421

Nonnegative values·of solutions (x, y) to the Diophantine equation x²+(x+937)² = y². A129974

T(n,k) is the total number of levels in all Dyck paths of semilength n containing exactly k path nodes; triangle T(n,k), n>=0, 1<=k<=n+1, read by rows. A371928

Row sums in A083175. A83175