Properties of the Number -654

Six Hundred Fifty-Four

Basics

Value: -655 → -654 → -653

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 109

Divisors: 1, 2, 3, 6, 109, 218, 327, 654

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: -1010001110

Octal: -1216

Duodecimal: -466

Hexadecimal: -28e

Square: 427716

Square Root: 25.573423705088842

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

Triangle, matrix inverse of A124733, companion to A123965. A126124

G.f.: x^(k²+k/2)/(mul(1-xⁱ,i=1..k)*mul(1+x^r,r=1..oo)) with k = 4. A246583

Expansion of 2*(x - 1)³/(3·x³ - 5·x² + x + 1 + sqrt(-(x - 1)³*(x + 1)²*(3·x + 1))). A378816

Triangle T(n,k), read by rows, defined by T(n,k)=3·T(n-1,k)-T(n-1,k-1)-T(n-2,k), T(0,0)=1, T(1,0)=2, T(1,1)=-1, T(n,k)=0 if k<0 or if k>n. A123971

Triangle, read by rows, where T(n,k) is defined for n>=1, k=1..2·n-1, by a formula analogous to the second-order Eulerian triangle A008517. A219120

a(n) = ∑_k=1..n μ(k) * n^{k - 1}. A344431

Expansion of cos(log(1+x))/exp(x). A9027

Triangle read by rows: T(n,k) is the number of compositions of n into nonzero parts with k parts directly followed by a different part, n>=0, 0<=k<=A004523(n-1). A238279

Triangle read by rows: T(n,k) is the number of compositions into nonzero parts with k parts directly followed by a different part, n>=0, 0<=k<=n. A238130

Smith (or joke) numbers: composite numbers k such that sum of digits of k = sum of digits of prime factors of k (counted with multiplicity). A6753