Properties of the Number -4661

Six Hundred Sixty-One

Basics

Value: -4662 → -4661 → -4660

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 59 × 79

Divisors: 1, 59, 79, 4661

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1001000110101

Octal: -11065

Duodecimal: -2845

Hexadecimal: -1235

Square: 21724921

Square Root: 68.27151675479314

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

Partial sums of A127511. A127513

a(n) = ∑_k=1..n (-1)^k*k³*floor(n/k). A366917

First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 181", based on the 5-celled von Neumann neighborhood. A270629

Sum of the first n primes. A7504

Number of 7's in all partitions of n. A24791

a(n) = n·prime(n) - ∑_i=1..n prime(i). A152535

A051838 gives numbers m such that the sum of first m primes divides the product of the first m primes. This sequence gives corresponding values of the sum of first m primes. A140763

a(n) = ∑_{k=0..floor(n/2)} T(n-k,k), T given by A026747. A26757

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k up-down runs (1 <= k <= n). A186370

Compound filter: a(n) = P(A001511(n), A161942(n)), where P(n,k) is sequence A000027 used as a pairing function. A286260