Properties of the Number -1455

Four Hundred Fifty-Five

Basics

Value: -1456 → -1455 → -1454

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 × 97

Divisors: 1, 3, 5, 15, 97, 291, 485, 1455

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -10110101111

Octal: -2657

Duodecimal: -A13

Hexadecimal: -5af

Square: 2117025

Square Root: 38.144462245521304

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/(1-x*(1-8·x)). A145978

The r-th term of the n-th row of the following array contains the sum of r successively decreasing integers beginning from n. 0 < r <= n. Sequence contains the leading diagonal. A110427

a(n) = a(n - 1) - 2·a(n - 2) + a(n - 3) - 2·a(n - 4) + a(n - 5). A122582

A symmetrical triangle sequence: T(n, k) = q^k + q^n-k - qⁿ, with q=3. A176225

Floor(r·a(n-1)) - floor(r·a(n-2)), where r = 3/2, a(0) = 1, a(1) = 1. A275865

Triangle read by rows: T(n,k), 0 <= k <= n, gives the coefficients of the Charlier polynomials (with parameter a=1), ordered by rising powers. A137338

Triangle T(n, k, q) = q^k*Q(k, n, q), with T(0, 0, q) = -2, where Q(k, n, q) = (1/q)*( -Q(k-1, n, q) + (1+q)*p(q, k-1)ⁿ), Q(k, 0, q) = -q*(1+q)ⁿ, p(q, n) = ∏_j=1..n ( (1-q^k)/(1-q) ), and q = 2, read by rows. A156222

a(n) = 3 - 2·3ⁿ. A165746

Expansion of tan(log(1+x)*cosh(x)). A9650

Number of partitions of n into distinct parts such that number of parts is odd. A67659