Properties of the Number -122640

One Hundred Twenty-Two Thousand Six Hundred Forty

Basics

Value: -122641 → -122640 → -122639

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ⁴ × 3 × 5 × 7 × 73

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

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11101111100010000

Octal: -357420

Duodecimal: -5AB80

Hexadecimal: -1df10

Square: 15040569600

Square Root: 350.1999428897726

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

Number of ternary irreducible monic polynomials of degree n; dimensions of free Lie algebras. A27376

a(n) = floor(3ⁿ / n). A92763

a(n) = 1·2*3·4*5·6*7·8*9 - 10·11·12·13·14·15·16·17·18 + 19·20·21·22·23·24·25·26·27 - ... + (up to n). A319550

∏_k>=1 1/(1 - x^k)^a(k) = 1 + 3x. A38064

∏_k>=1(1 + x^k)^a(k) = 1 + 3x. A38068

Number of "sets of even lists" for even n, cf. A000262. A88026

Inverse Weigh transform of 3ⁿ. A306157

Let sigma_m (n) be result of applying sum-of-divisors function m times to n; call n (m,k)-perfect if sigma_m (n) = k·n; sequence gives the (3,k)-perfect numbers. A19292

Triangular array read by rows. T(n,k) is the number of partial permutations (injective partial functions) of {1,2,...,n} that have exactly k elements in a cycle. The k elements are not necessarily in the same cycle. A fixed point is considered to be in a cycle. A206703

Triangle defined by g.f. A(x,y) = exp( ∑_n>=1 xⁿ/n * ∑_k=0..n binomial(n², k²) * y^k ), as read by rows. A228902