Properties of the Number -4814

Eight Hundred Fourteen

Basics

Value: -4815 → -4814 → -4813

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 29 × 83

Divisors: 1, 2, 29, 58, 83, 166, 2407, 4814

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1001011001110

Octal: -11316

Duodecimal: -2952

Hexadecimal: -12ce

Square: 23174596

Square Root: 69.38299503480663

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

G.f.: ∏_m>0 (1 - x^m + 2!*x^2·m - 3!*x^3·m + 4!*x^4·m - 5!*x^5·m). A293257

Number of strict integer partitions of n containing the sum of some subset of the parts. A variation of sum-full strict partitions. A364272

Number of compositions of n into pairwise relatively prime parts. A101268

a(n) = A031287(n) + A031288(n) + A031289(n) + A031290(n) + A031291(n) + A031292(n) + A031293(n) + A031294(n) + A031295(n) + A031296(n). A193428

Numbers n such that n² contains exactly 8 different digits. A54036

Number T(n,k) of tilings of a 5 X n rectangle with pentominoes of any shape and exactly k pentominoes of shape P; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A247706

a(n) = floor((5/4)ⁿ). A65565

Partial sums of ceiling(n²/7). A175822

a(n) = ∑_{k=0..floor(n/2)} binomial(n-1-k,k) * binomial(2·n-4·k,n-2·k). A360290

Numbers k such that sopf(k) + 1 = sopf(k+1), where sopf(k) = A008472(k). A64111