Properties of the Number -4606

Six Hundred Six

Basics

Value: -4607 → -4606 → -4605

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 7 ² × 47

Divisors: 1, 2, 7, 14, 47, 49, 94, 98, 329, 658

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1000111111110

Octal: -10776

Duodecimal: -27BA

Hexadecimal: -11fe

Square: 21215236

Square Root: 67.86751800382861

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

Square array read by antidiagonals downwards: A(n, k) = (∑_i=1..n i^k) - (n+1)^k for n >= 1, k >= 1. A290844

Coordination sequence for "reo" 3D uniform tiling. A299279

a(n) = n times R(n) where R(n) (A004086) is the digit reversal of n. A61205

Number of integer partitions of n whose product is divisible by the sum of primes of their parts. A330954

Array read by descending antidiagonals: A(n,k) is the number of chiral pairs of colorings of the edges of a regular n-dimensional simplex using up to k colors. A327085

Square array A(n, k) = 2·A246278(n, k) - σ(A246278(n, k)), read by falling antidiagonals. Deficiency applied to the prime shift array. A378979

E.g.f. is series reversion of log(1+x)*(1-x). A52892

Triangular array generated by its row sums: T(n,0)=1 for n >= 0, T(1,1)=2, T(n,k)=T(n,k-1)+d·r(n-k) for k=2,3,...,n, d=(-1)^k+1, n >= 2, r(h)=sum of the numbers in row h of T. A54098

a(n) = n³ - n² - n - 1. A83074

Heinz number of the ω-sequence of n!. A325275