Properties of the Number -42435

Forty-Two Thousand Four Hundred Thirty-Five

Basics

Value: -42436 → -42435 → -42434

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 5 × 23 × 41

Divisors: 1, 3, 5, 9, 15, 23, 41, 45, 69, 115

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1010010111000011

Octal: -122703

Duodecimal: -20683

Hexadecimal: -a5c3

Square: 1800729225

Square Root: 205.99757280123472

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

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k increasing cycles of length >=2 (0<=k<= n/2). A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1) < b(2) < b(3) < ... . A186757

Denominators of the convergents of the continued fraction for Catalan's constant L(2, chi4), where L(s, chi4) is the Dirichlet L-function for the non-principal character modulo 4. A153070

a(n) = 2401·n² - 3822·n + 1520. A157370

Product of two consecutive odd numbers k, k+2 such that (k*(k+2))+-2 are primes. A174383

Numerators of continued fraction convergents to sqrt(866). A42672

a(n) = ∑_k=0..n (-1)^k * binomial(n+2·k,n-k) * Fibonacci(k+1). A390855

a(n) = ∑_k=0..n (-1)^k * binomial(n+2·k+2,n-k) * Fibonacci(k+1). A390857