Properties of the Number -11451

Eleven Thousand Four Hundred Fifty-One

Basics

Value: -11452 → -11451 → -11450

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 11 × 347

Divisors: 1, 3, 11, 33, 347, 1041, 3817, 11451

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -10110010111011

Octal: -26273

Duodecimal: -6763

Hexadecimal: -2cbb

Square: 131125401

Square Root: 107.00934538627924

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

Partial sums of A097988 (d₃(n)²). A330570

a(n) = floor(X/Y) where X = concatenation in decreasing order of (2n)-th even number to (n+1)-th even number and Y = that of first n even numbers in increasing order. A67092

a(n) = ∑_d∣n d·binomial(n/d+d-2,d-1). A157020

p² + 2 where p is a prime. A61725

Triangle read by rows, based on a simple Fibonacci recursion rule. A111669

Expansion of g.f. ∏_k>=1 1/(1-x^σ(k)). A111865

Erroneous version of A128241. A241712

Odd winning positions in Fibonacci nim. A120904

The smallest start of a run of exactly n consecutive positive integers for which the number of exponential divisors of their factorials is strictly decreasing. A388846

a(n) = n*(21·n + 1)/2. A22279