Properties of the Number -4662

Six Hundred Sixty-Two

Basics

Value: -4663 → -4662 → -4661

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 7 × 37

Divisors: 1, 2, 3, 6, 7, 9, 14, 18, 21, 37

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1001000110110

Octal: -11066

Duodecimal: -2846

Hexadecimal: -1236

Square: 21734244

Square Root: 68.27884006044626

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

Expansion of b(q) / b(q²) in powers of q where b() is a cubic AGM θ function. A141094

Expansion of b(q³)b(q²)²/(b(q)b(q⁶)²) in powers of q where b(q) is a cubic AGM function. A122831

The convolution matrix of the double factorial of odd numbers (A001147). A35342

G.f.: ∏_k>=1 (1 + 2·x^k). A32302

7 times triangular numbers: 7·n*(n+1)/2. A24966

Trajectory of n under the Reverse and Add! operation carried out in base 4 (presumably) does not reach a palindrome and (presumably) does not join the trajectory of any term m < n. A75421

When expressed in base 3 and then interpreted in base 7, is a multiple of the original number. A62884

Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=7. A135192

Number of ways to place 2 nonattacking knights on an n X n board. A172132

Array read by antidiagonals: T(n,k)=number of permutations p() of 1..n+k with centered difference p(i+1)-p(i-1) < 0 exactly k-1 times. A180887