Properties of the Number -275568

Two Hundred Seventy-Five Thousand Five Hundred Sixty-Eight

Basics

Value: -275569 → -275568 → -275567

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 33

Digital Root: 6

Palindrome: No

Factorization: 2 ⁴ × 3 × 5741

Divisors: 1, 2, 3, 4, 6, 8, 12, 16, 24, 48

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7989 Try Today's Challenge

Representations

Binary: -1000011010001110000

Octal: -1032160

Duodecimal: -113580

Hexadecimal: -43470

Square: 75937722624

Square Root: 524.9457114788157

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

Number of walks on square lattice that start and end at origin after 2n steps, not touching origin at intermediate stages. A54474

Number A(n,k) of k-dimensional cubic lattice walks with 2n steps from origin to origin and avoiding early returns to the origin; square array A(n,k), n>=0, k>=0, read by antidiagonals. A361397

a(n) = Pell(n)*A034896(n) for n >= 1, with a(0)=1, where A034896 lists the number of solutions to a² + b² + 3·c² + 3·d² = n. A209451

a(n) = Pell(n)*A028594(n) for n>=1, with a(0)=1, where A028594 lists the coefficients in (theta₃(x)*theta₃(7·x)+theta₂(x)*theta₂(7·x))². A209456

Triangular array read by rows. T(n,k) is the number of square lattice walks that start and end at the origin after 2n steps having k primitive loops; n>=1, 1<=k<=n. A227997

Number of strings of numbers x(i=1..n) in 0..7 with sum i⁴*x(i) equal to n⁴*7. A184346