Properties of the Number -35168

Thirty-Five Thousand One Hundred Sixty-Eight

Basics

Value: -35169 → -35168 → -35167

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 ⁵ × 7 × 157

Divisors: 1, 2, 4, 7, 8, 14, 16, 28, 32, 56

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1000100101100000

Octal: -104540

Duodecimal: -18428

Hexadecimal: -8960

Square: 1236788224

Square Root: 187.53133071569667

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

Fourier coefficients of E_0,4. A35016

Number of ways of writing n as a sum of 8 squares. A143

Number of circular permutations of length n without modular 3-sequences. A165962

Number of hexagonal n-element polyominoes whose graph is a path. A3104

G.f. A(x,y) satisfies: x·y = ∑_n=-oo..+oo (-1)ⁿ * x^n*(n+1/2) * A(x,y)ⁿ, with coefficients T(n,k) of xⁿ*y^k in A(x,y) given as a triangle read by rows. A355350

a(1) = 1, a(n) = ∑_k=1^n-1 (5^k - 1)/4 a(k). A15506

Number of circular permutations of length n without modular consecutive triples i,i+2,i+4. A174075

θ series of {D₈}* lattice. A8427

a(0) = 1; for n>0, a(n) = 16 times sum of cubes of divisors of n. A92820

Triangle read by rows: number of circular permutations of [1..n] with k modular progressions of rise 1, distance 1 and length 3 (n >= 3, 0 <= k <= n). A216722