Properties of the Number -41508

Forty-One Thousand Five Hundred Eight

Basics

Value: -41509 → -41508 → -41507

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 1153

Divisors: 1, 2, 3, 4, 6, 9, 12, 18, 36, 1153

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1010001000100100

Octal: -121044

Duodecimal: -20030

Hexadecimal: -a224

Square: 1722914064

Square Root: 203.73512215619573

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 T(n,k) of permutations p of [n] with no fixed points such that |{ j : |p(j)-j| = 1 }| = k; triangle T(n,k), n >= 0, 0 <= k <= n, read by rows. A323671

The Wiener index of the para-polyphenyl chain with n hexagons (see the Dou et al. and the Deng references). A216112

a(n) = T(n,[ n/2 ]), where T is the array in A026268. A26297

The number of primes in A013918 less than 10ⁿ. A189153

Numbers k such that Bernoulli number B_k has denominator 1919190. A295595

Number of partitions p of n such that 3·min(p) + (number of parts of p) is not a part of p. A238543

a(n) is the least integer k such that there are n values of i <= k for which gpf(i² + 1) = gpf(k² + 1), where gpf(x) is the greatest prime factor of x. A258840