Properties of the Number -116509

One Hundred Sixteen Thousand Five Hundred Nine

Basics

Value: -116510 → -116509 → -116508

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 263 × 443

Divisors: 1, 263, 443, 116509

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11100011100011101

Octal: -343435

Duodecimal: -57511

Hexadecimal: -1c71d

Square: 13574347081

Square Root: 341.33414713444654

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

First differences of (A113405 prefixed with a 0). A131666

Start with a(1) = 1, a(2) = 3, then a(n)*2^k = a(n+1) + a(n+2), with 2^k the smallest power of 2 (k>0) such that all terms a(n) are positive integers. A233526

a(n) is the least number such that σ(a(n)) = σ(R(a(n)))/n, where R(n) is the digit reverse of n and σ(n) is the sum of the divisors of n. A284498

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

a(0)=1. a(n+1)=2·a(n)-A130151(n). A132780

Inverse binomial transform of A131666 after removing A131666(0) = 0. A135258

Number of (n+3) X (1+3) 0..1 arrays with each row and column divisible by 9, read as a binary number with top and left being the most significant bits. A262333

a(n+3) = 2ⁿ - a(n), a(0)=a(2)=1, a(1)=0 for n >= 0. A328881

Positions of remoteness 2 in Beans-Don't-Talk. A5698