Properties of the Number -26016

Twenty-Six Thousand Sixteen

Basics

Value: -26017 → -26016 → -26015

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ⁵ × 3 × 271

Divisors: 1, 2, 3, 4, 6, 8, 12, 16, 24, 32

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -110010110100000

Octal: -62640

Duodecimal: -13080

Hexadecimal: -65a0

Square: 676832256

Square Root: 161.29476122924763

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

Number of polygons formed when every pair of vertices of a regular n-gon are joined by an infinite line. A344857

a(n) = a(n-1) + a(m) for n >= 4, where m = 2·n - 2 - 2^p+1 and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1, a(2) = 2, and a(3) = 1. A50043

a(n) = 1 + (number of partitions of n, n>0). A52810

Numbers m such that the smallest digit in the decimal expansion of 1/m is 3, ignoring leading and trailing 0's. A352157

Expansion of ∏_k>=1 1/((1 - x^2·k)*(1 - x^2·k-1)³). A298311

G.f.: ∑_n>=0 (n+1)*(n+2)/2 * (x + xⁿ)ⁿ. A325998

Number of permutations of {1..n} with the sum of squared adjacent differences <= n*(n+1)/2. A180070

a(n) = 102·2ⁿ - 96 (n>=1). A304377

A344857(2·n). A347320

Numbers k such that z(k) = j(k), where z(k) = sopf(k - d(k)), j(k) = d(sopf(k) + k), sopf(k) = A008472(k) and d(k) = A000005(k). A63961