Properties of the Number -30665

Thirty Thousand Six Hundred Sixty-Five

Basics

Value: -30666 → -30665 → -30664

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 5 × 6133

Divisors: 1, 5, 6133, 30665

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -111011111001001

Octal: -73711

Duodecimal: -158B5

Hexadecimal: -77c9

Square: 940342225

Square Root: 175.1142484208524

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

Number of ways to split 1, 2, 3, ..., 6n into n arithmetic progressions each with 6 terms. A104432

Number of arrangements of rooks with rotational symmetry on a triangular grid with n grid points on each side and no two rooks on the same row, column or diagonal. A326611

Total number of 1's in the binary expansion of parts in all partitions of n into distinct parts. A347060

a(n) = 2·F(n-1) + 2·F(n-3) + 10·F(n-5) + 9·F(n-8) where n >= 8 and F = A000045. A280932

Decimal part of cube root of a(n) starts with 3: first term of runs. A34129

G.f.: exp( ∑_n>=1 A000984(n)*A000172(n)/4·xⁿ/n ), which involves central binomial coefficients (A000984) and Franel numbers (A000172). A199816

Number of (n+2) X (1+2) 0..1 arrays with no 3·3 subblock diagonal sum 0 or 1 and no antidiagonal sum 0 or 1 and no row sum 0 or 1 and no column sum 0 or 1. A255020

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, 0, 0), (-1, 1, -1), (1, 0, 1), (1, 1, -1)}. A149206