Properties of the Number -42408

Forty-Two Thousand Four Hundred Eight

Basics

Value: -42409 → -42408 → -42407

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ³ × 3 ² × 19 × 31

Divisors: 1, 2, 3, 4, 6, 8, 9, 12, 18, 19

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1010010110101000

Octal: -122650

Duodecimal: -20660

Hexadecimal: -a5a8

Square: 1798438464

Square Root: 205.93202762076618

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

Jordan function J₃(n). A59376

Multiplicative with a(p^e) = 1 - p³. A63453

O.g.f. A(x) satisfies: [xⁿ] exp( n*(n+1) * x ) / A(x) = 0 for n>0. A304319

Triangle read by rows: T(n,k) = A059382(n)/(A059382(k)*A059382(n-k)). A238743

a(n) = σ(n)*π(n²), where σ(n) is the sum of all (positive) divisors of n, and π(x) is the number of primes not exceeding x. A263325

a(n) = n³ * ∑_d∣n (-1)^{n/d + 1} * μ(d) / d³. A338548

Define an array by d(m, 0) = 1, d(m, 1) = m; d(m, k) = (m - k + 1) d(m+1, k-1) - (k-1) (m+1) d(m+2, k-2). Sequence gives d(n,3). A126935

Gegenbauer polynomial C_n²(3). A144133

Number of (undirected) Hamiltonian paths in the n-Hanoi graph. A308134

The unitary totient of the smallest cube divisible by n. A392088