Properties of the Number -12061

Twelve Thousand Sixty-One

Basics

Value: -12062 → -12061 → -12060

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 7 × 1723

Divisors: 1, 7, 1723, 12061

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10111100011101

Octal: -27435

Duodecimal: -6B91

Hexadecimal: -2f1d

Square: 145467721

Square Root: 109.82258419833327

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) = 6·n² + 10·n + 5. A201279

Number of distinct values of ∑_i=0..n x(i)*binomial(n,i), where the x(i) have values in 0..3. A205538

Number of ways to write n as an ordered sum of 7 primes (counting 1 as a prime). A341986

p-INVERT of (1,0,0,1,0,0,1,0,0,...), where p(S) = 1 - S - S² - S³. A292322

Number of ways to write n as an ordered sum of seven positive Fibonacci numbers (with a single type of 1). A357694

Triangle read by rows where T(n,k) is the number of factorizations of (n+1)! into k distinct factors. A157836

The broken eggs problem. A256101

a(n) = floor(2nd elementary symmetric function of ∑_j=1..k 1/j, k = 1,2,...,n). A25212

Number of strings of numbers x(i=1..7) in 0..n with sum i³*x(i)² equal to 343·n². A184308

Number of zero-sum -n..n arrays of 4 elements with first through third differences also in -n..n. A202512