Properties of the Number -42585

Forty-Two Thousand Five Hundred Eighty-Five

Basics

Value: -42586 → -42585 → -42584

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 × 17 × 167

Divisors: 1, 3, 5, 15, 17, 51, 85, 167, 255, 501

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1010011001011001

Octal: -123131

Duodecimal: -20789

Hexadecimal: -a659

Square: 1813482225

Square Root: 206.36133358747225

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(1) = 0, a(2) = 1, and for n > 2, a(n) = 2·a(A252463(n)) + [n == 1 (mod 4)]. A292385

L-matrix for Euler numbers A000111(n+1). A147315

Odd composite numbers k such that cototient(k) - φ(k) = k - 2*φ(k) is an odd prime. A83255

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k up-down runs (1 <= k <= n). A186370

Number of 3 X 3 integer matrices with elements in the range [ -n,n ] which represent a rotation of order 2. A53171

a(n) = -2ⁿ*(E(n, 1/2) + E(n, 1) + (n mod 2)*2*(E(n+1, 1/2) + E(n+1, 1))), where E(n, x) are the Euler polynomials. A240559

Antidiagonal sums of the convolution array A213833. A213834

a(n) = -2^2·n+1*(E(2·n+1, 1/2) + E(2·n+1, 1) + 2*(E(2·n+2, 1/2) + E(2·n+2, 1))), where E(n,x) are the Euler polynomials. A241242

Numbers·that are equal to lpf(x)*gpf(x)*(lpf(x)+gpf(x))/2, where lpf(x) < gpf(x) are the least and the greatest prime factors of x: A020639 and A006530. A307108