Properties of the Number -17457

Seventeen Thousand Four Hundred Fifty-Seven

Basics

Value: -17458 → -17457 → -17456

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 11 × 23 ²

Divisors: 1, 3, 11, 23, 33, 69, 253, 529, 759, 1587

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -100010000110001

Octal: -42061

Duodecimal: -A129

Hexadecimal: -4431

Square: 304746849

Square Root: 132.12494087037467

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

Expansion of (1-x)^-1/(1+x²+2·x³). A77890

a(n) = (n+1)*(n²+n+2)/2; g.f.: (1 + 2·x²) / (1 - x)⁴. A6000

For any number n take the polynomial formed by the product of the terms (x-π), where π's are the prime factors of n. Then calculate the area between the minimum and the maximum value of the prime factors. This sequence lists the numbers for which the area is equal to zero. A203614

a(n) = 16n² + n. A157474

The fifth term of the greedy B_n set of natural numbers. A369817

Partial sums of n 3-spaced triangular numbers beginning with t(3), e.g., a(2) = t(3)+t(6) = 6+21 = 27. A85788

Erlang C queues type triangular sequence based on A122525. A137216

Triangle T(n, k) = n^n-1 * Fibonacci(k)ⁿ⁺¹ - (n-1)! * (Fibonacci(k) - 1) * ∑_j=0..n (n·Fibonacci(k))^j/j!, with T(n, 0) = n! and T(n, 1) = n^n-1, read by rows. A137227

Number of partitions of 3n into exactly 4 parts. A256313

Number of partitions of 5n into exactly 4 parts. A256327