Properties of the Number -42317

Forty-Two Thousand Three Hundred Seventeen

Basics

Value: -42318 → -42317 → -42316

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 11 × 3847

Divisors: 1, 11, 3847, 42317

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1010010101001101

Octal: -122515

Duodecimal: -205A5

Hexadecimal: -a54d

Square: 1790728489

Square Root: 205.7109622747412

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

T(n,m) = number of 1..m integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1. A171275

E.g.f. satisfies: A(x) * log(A(x)) = exp(x·A(x)) - 1. A349588

a(n) = (1/5) * ∑_k=0..n-1 binomial(5·n,5·k+1). A387743

Triangle read by rows: numerators of the almost-Riordan array ( (3·x - 2 - 2·sqrt(1 - x))/(-x² + 5·x - 2 + 2*(x - 1)*sqrt(1 - x)) | 4/(2*(1 - x)*sqrt(1 - x) + x² - 5·x + 2), (8 - 4·x - 8·sqrt(1 - x))/x ). A389710

Number of 1..n integer arrays v[1..6] of length 6 with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..5. A171343

Number of 1..6 integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1. A171280