Properties of the Number -111465

One Hundred Eleven Thousand Four Hundred Sixty-Five

Basics

Value: -111466 → -111465 → -111464

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 5 × 2477

Divisors: 1, 3, 5, 9, 15, 45, 2477, 7431, 12385, 22293

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -11011001101101001

Octal: -331551

Duodecimal: -54609

Hexadecimal: -1b369

Square: 12424446225

Square Root: 333.86374466239965

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 e.g.f.: exp(sinh(x)-log(x+1))=1+1/2!*x²-1/3!*x³+9/4!*x⁴-33/5!*x⁵... A13488

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k increasing odd cycles (0<=k<=n). A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1)<b(2)<b(3)<... . A cycle is said to be odd if it has an odd number of entries. For example, the permutation (152)(347)(6)(8) has 3 increasing odd cycles. A186761

Number of permutations of {1,2,...,n} having no increasing odd cycles. A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1)<b(2)<b(3)<... . A cycle is said to be odd if it has an odd number of entries. A186762

a(n) = ∑_k=0..n binomial(3·n+2,k) * binomial(3·n-k-1,n-k). A386836

Denominators of continued fraction convergents to sqrt(865). A42671

Numbers k such that k and k² use only the digits 1, 2, 4, 5 and 6. A136988

E.g.f.: exp( ∑_n>=1 x^2·n / (2·n*(2·n-1)) ) = ∑_n>=0 a(n)*x^2·n/(2·n)!. A211393