Properties of the Number -15334

Fifteen Thousand Three Hundred Thirty-Four

Basics

Value: -15335 → -15334 → -15333

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 11 × 17 × 41

Divisors: 1, 2, 11, 17, 22, 34, 41, 82, 187, 374

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11101111100110

Octal: -35746

Duodecimal: -8A5A

Hexadecimal: -3be6

Square: 235131556

Square Root: 123.8305293536291

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

a(n) = ∑_i=0..n digsum(i)⁴, where digsum(i) = A007953(i). A231689

a(n) is the total number of down steps between the (n-1)-th and n-th up steps in all 3_2-Dyck paths of length 4·n. A 3_2-Dyck path is a lattice path with steps (1, 3), (1, -1) that starts and ends at y = 0 and stays above the line y = -2. A334980

G.f.: Im((2·i; x)_oo), where (a; q)_oo is the q-Pochhammer symbol, i = sqrt(-1). A292140

a(n) = 3·n³ + 2·n² + n. A67389

Main diagonal of array A[k,n] = n-th sum of 3 consecutive k-gonal numbers, k>2. A130423

Poincaré series [or Poincare series] P(C_4,2; x). A124612

Number of partitions of n into at most 1² copy of 1, 2² copies of 2, 3² copies of 3, ... . A303944

a(n) is the least number k for which A330437(k) = n. A330704

a(n) = (21·n² + 9·n + 2)/2. A381109

Number of (n+1)X(n+1) -10..10 symmetric matrices with every 2X2 subblock having sum zero and three or four distinct values. A211818