Properties of the Number 16504

Sixteen Thousand Five Hundred Four

Basics

Value: 16503 → 16504 → 16505

Parity: even

Prime: No

Previous Prime: 16493

Next Prime: 16519

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ³ × 2063

Divisors: 1, 2, 4, 8, 2063, 4126, 8252, 16504

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100000001111000

Octal: 40170

Duodecimal: 9674

Hexadecimal: 4078

Square: 272382016

Square Root: 128.4678948220138

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

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k nonincreasing odd cycles (0<=k<=floor(n/3)). 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 1 nonincreasing odd cycle. A186766

Number of regions formed inside square by diagonals and the segments joining the vertices to the points dividing the sides into n equal length segments. A108914

Number of ordered triples (w,x,y) with all terms in {1,...,n} and w²>=x²+y². A211636

a(n) = Sum{a(k): k=0,1,2,...,n-4,n-2,n-1}; a(n-3) is not a summand; initial terms are 0,1,2. A49858

a(n) is the number of permutations of length n that avoid the pattern 321 and the mesh pattern (12, 279) or the same sequence for the mesh patterns (12, 309), (12, 345), (12, 465). A289607

Numbers n such that gcd(n, φ(n)) = gcd(φ(n), σ(n)) = gcd(σ(n), n) = τ(n). A217301

Number of partitions of n² into at most 10 square parts. A255214

Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) - b(n-2) + n, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences. A294563

Numbers whose set of base-11 digits is {1,4}. A32823

Number of n X 2 arrays of the minimum value of corresponding elements and their horizontal, vertical or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 n X 2 array. A220198