Properties of the Number -12240

Twelve Thousand Two Hundred Forty

Basics

Value: -12241 → -12240 → -12239

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 ⁴ × 3 ² × 5 × 17

Divisors: 1, 2, 3, 4, 5, 6, 8, 9, 10, 12

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -10111111010000

Octal: -27720

Duodecimal: -7100

Hexadecimal: -2fd0

Square: 149817600

Square Root: 110.63453348751464

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

The third self-composition of A120009; g.f.: A(x) = G(G(G(x))), where G(x) = g.f. of A120009. A120012

Square table, read by antidiagonals, of coefficients of x^k in the n-th self-composition of the g.f. of A120009, so that: T(n,k) = [x^k] { (x-x²) o x/(1-n·x) o (1-sqrt(1-4·x))/2 } for n>=1, k>=1. A120013

Triangle T(n, k) = k⁴ - n⁴ + 2·k*n*(1 - k²*n²), read by rows. A123963

Triangle T(n,k), 0 <= k <= n, read by rows given by: T(0,0)=1, T(n,k)=0 if k < 0 or if k > n, T(n,0) = T(n-1,1), T(n,k) = T(n-1,k-1) + 3·T(n-1,k) + T(n-1,k+1) for k >= 1. A126970

Number of subsets of {1..n} such that it is possible to choose a different prime factor of each element. A370582

a(n) = n*(n+1)*(n+2)*(n+3)/6. A33488

Septuple factorial, 7-factorial, n!7, n!!!!!!!, a(n) = n·a(n-7) if n > 1, else 1. A114799

7-factorial numbers A114799(7·n+3): Partial products of A017017(k) = 7·k+3, a(0) = 1. A144739

Four times second pentagonal numbers: a(n) = 2·n*(3·n+1). A33580

Number of 3-Motzkin paths of length n with no level steps at height 0. A117641