Properties of the Number -2630

Six Hundred Thirty

Basics

Value: -2631 → -2630 → -2629

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 × 5 × 263

Divisors: 1, 2, 5, 10, 263, 526, 1315, 2630

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -101001000110

Octal: -5106

Duodecimal: -1632

Hexadecimal: -a46

Square: 6916900

Square Root: 51.28352561983234

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

E.g.f. A(x) satisfies A(x) = 1/( 1 - x·cos(x·A(x)) )². A381379

Number of partitions of n such that some part is a sum of two or more other parts. A237668

Numbers m such that the Bernoulli number B_m has denominator 66. A51230

Goodstein sequence starting with 4: to calculate a(n+1), write a(n) in the hereditary representation in base n+2, then bump the base to n+3, then subtract 1. A56193

Starts of runs of 3 consecutive Zeckendorf-Niven numbers (A328208). A328210

Number of integer compositions of n whose leaders of strictly decreasing runs are identical. A374760

Compound filter: a(n) = P(A003557(n), A048250(n)), where P(n,k) is sequence A000027 used as a pairing function. A291750

Number of strict integer partitions with sum <= n that can be linearly combined using nonnegative coefficients to obtain n. A365311

Compound filter: a(n) = T(A046523(n), A278222(n)), where T(n,k) is sequence A000027 used as a pairing function. A286163

Inverse Moebius transform of Fibonacci numbers 1,1,2,3,5,8,... A7435