Properties of the Number 16539

Sixteen Thousand Five Hundred Thirty-Nine

Basics

Value: 16538 → 16539 → 16540

Parity: odd

Prime: No

Previous Prime: 16529

Next Prime: 16547

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 37 × 149

Divisors: 1, 3, 37, 111, 149, 447, 5513, 16539

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100000010011011

Octal: 40233

Duodecimal: 96A3

Hexadecimal: 409b

Square: 273538521

Square Root: 128.60404348231046

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

Edge-rooted tree-like octagonal systems (see the Cyvin et al. reference for precise definition). A121114

Let p = A002145(n) be the n-th prime of the form 4k+3, then a(n) is the smallest number such that p is the smallest prime of the form 4k+3 for which 4·a(n)+2-p is prime. A217696

Continued fraction for π⁴. A58286

Write 1, 2, 3, 4, ... counterclockwise in a hexagonal spiral around 0 starting left down, then a(n) is the sequence found by reading from 0 in the vertical upward direction. A63436

Square matrix read by antidiagonals: T(m,n) = m-th term in the continued fraction expansion of πⁿ. A137299

Related to enumeration of rooted catapolyoctagons (see Cyvin reference for precise definition). A121116

Consecutive states of the linear congruential pseudo-random number generator (257·s + 41) mod 2¹⁶ when started at s=1. A384961

Let sequence B_n={b_m} be defined by: b₁=prime(n), b₂=prime(n+1); for m>=3, b_m=b_m-2+b_m-1 if b_m-2+b_m-1 is not semiprime, otherwise b_m is the least prime divisor of b_m-2+b_m-1. Then a(n) is the maximal term of sequence B_n, or a(n)=0 if B_n is unbounded. A221218

Continued fraction for log(23/2). A16539

a(1) = 1. Thereafter, a(n) is the least novel multiple of either prime(k+1) if rad(a(n-1)) = A002110(k), or ∏_{prime q; q < gpf(a(n-1)); and q!|a(n-1)} q otherwise. A364246