Properties of the Number -16256

Sixteen Thousand Two Hundred Fifty-Six

Basics

Value: -16257 → -16256 → -16255

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ⁷ × 127

Divisors: 1, 2, 4, 8, 16, 32, 64, 127, 128, 254

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11111110000000

Octal: -37600

Duodecimal: -94A8

Hexadecimal: -3f80

Square: 264257536

Square Root: 127.49901960407382

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

Dirichlet inverse of A011782, 2^n-1. A349452

a(n) = 4ⁿ - 2ⁿ. A20522

Twice even perfect numbers. Also a(n) = M(n)*(M(n)+1), where M(n) is the n-th Mersenne prime A000668(n). A139256

Abundant numbers n for which the abundance d = σ(n) - 2·n is a proper divisor, that is, 0 < d < n and d | n. A181595

Array of values of Jordan function J_k(n) read by antidiagonals (version 1). A59379

Array of values of Jordan function J_k(n) read by antidiagonals (version 2). A59380

G.f.: 1/((1-2·x)*(1-2·x²)). A122746

Numbers k whose abundance is 128: σ(k) - 2·k = 128. A292626

Numbers of the form q*(2^k), where q is one of the Mersenne primes (A000668) and k >= 0. A335431

Sum of every 4th entry of row n in Pascal's triangle, starting at binomial(n,2). A38505