Properties of the Number -4566

Five Hundred Sixty-Six

Basics

Value: -4567 → -4566 → -4565

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 761

Divisors: 1, 2, 3, 6, 761, 1522, 2283, 4566

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: -1000111010110

Octal: -10726

Duodecimal: -2786

Hexadecimal: -11d6

Square: 20848356

Square Root: 67.5721836261046

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. satisfies: ∑_n>=0 xⁿ*A_n(x) = x + x², where A_n+1(x) = A_n(A(x)) denotes iteration with A₀(x)=x. A180023

Number of partitions of n into parts having a common factor. A18783

a(n) = ∑_d∣n p(d), where p(d) = A000041 = number of partitions of d. A47968

Number of partitions of partitions of n where all partitions have the same sum. A305551

Coordination sequence for 3D uniform tiling formed by stacking parallel layers of the 3.12.12 2D tiling (cf. A250122). A299257

Twice-partitioned numbers where the first partition is constant. A279787

Number of ways to split an integer partition of n into consecutive subsequences with equal sums. A317715

a(n) = (3·n⁵ - 35·n⁴ + 145·n³ - 235·n² + 152·n + 30)/30. A161704

Partial sums of A097988 (d₃(n)²). A330570

G.f.: exp( ∑_n>=1 σ(3n)*xⁿ/n ). A182819