Properties of the Number -36879

Thirty-Six Thousand Eight Hundred Seventy-Nine

Basics

Value: -36880 → -36879 → -36878

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 33

Digital Root: 6

Palindrome: No

Factorization: 3 × 19 × 647

Divisors: 1, 3, 19, 57, 647, 1941, 12293, 36879

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1001000000001111

Octal: -110017

Duodecimal: -19413

Hexadecimal: -900f

Square: 1360060641

Square Root: 192.03905852716525

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

Coefficients in asymptotic expansion of normal probability function. A97397

Partial sums of A000337(n+4), n >= 0. A45618

a(n) is the number of ways the set {1³, 2³, ..., n³} can be partitioned into two sets of equal sums. A113263

Triangle of numbers related to the generalized Catalan sequence C(2;n+1)=A064062(n+1), n>=0. A113647

Third diagonal (M=3) sequence of triangle A113647, called Y(2,1). A115150

Number of partitions of n such that 5*(greatest part) >= (number of parts). A347869

A sequence related to Catalan numbers A000108. A115138

Number of 1..3 integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1. A171277

Number of 1..n integer arrays v[1..10] of length 10 with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..9. A171347

Least k such that A359247(k) = n, or 0 if no such k exists. A359657