Properties of the Number -11460

Eleven Thousand Four Hundred Sixty

Basics

Value: -11461 → -11460 → -11459

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 5 × 191

Divisors: 1, 2, 3, 4, 5, 6, 10, 12, 15, 20

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10110011000100

Octal: -26304

Duodecimal: -6770

Hexadecimal: -2cc4

Square: 131331600

Square Root: 107.05138952858108

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

Self-convolution of 1 2 3 5 7 11 15 22 30 42 56 77 ... (A000041). A48574

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

Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=7. A135192

Expansion of 1/(1-x³-x⁴-x⁵). A17818

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero. A299814

Sum of digits of numbers between 0 and (8/9)*(10ⁿ-1). A89909

Odd triangle !n. This table read by rows gives the coefficients of sum formulas of n-th Left factorials (A003422). The k-th row (6>=k>=1) contains T(i,k) for i=1 to k+1, where k=[2·n+3+(-1)ⁿ]/4 and T(i,k) satisfies !n = ∑_i=1..k+1 T(i,k) * n^i-1 / (2·k-2)!. A102412

Number of partitions of 2n whose Ferrers-Young diagram allows more than one different domino tiling. A52837

a(n) = n-th prime·n-th nonprime. A127118

a(n) = 6*(n - 1)*(81·n - 104) for n >= 1. A304837