Properties of the Number 65279

Sixty-Five Thousand Two Hundred Seventy-Nine

Basics

Value: 65278 → 65279 → 65280

Parity: odd

Prime: No

Previous Prime: 65269

Next Prime: 65287

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 29 × 2251

Divisors: 1, 29, 2251, 65279

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1111111011111111

Octal: 177377

Duodecimal: 3193B

Hexadecimal: feff

Square: 4261347841

Square Root: 255.49755380433683

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 integer compositions of n whose leaders of strictly increasing runs are strictly decreasing. A374689

a(n) = ∑_d∣n (-1)^n/d+1*d⁸. A321553

Square array T(n,k), n >= 1, k >= 1, read by antidiagonals, where T(n,k) is the number of ordered k-tuples (x₁, x₂, ..., x_k) with gcd(x₁, x₂, ..., x_k) = 1 (1 <= {x₁, x₂, ..., x_k} <= n). A344527

Numbers which contain only the digit 3 in their base-4 representation, with at most one exception. If the exception is the most-significant digit, it must be the digit 1 or 2, otherwise the exception must be the digit 2. A188529

a(n) = ∑_{k = ceiling(n/2)..n-1} A354169(k). A354757

Square array A(n,k), n >= 1, k >= 0, read by antidiagonals: A(n,k) = ∑_d∣n (-1)^n/d+1*d^k. A322081

a(n) is the bitwise OR of (the binary expansions of) b(n+1) to b(2·n), where b is A354169. A354780

Square array T(n,k), n >= 1, k >= 1, read by antidiagonals, where T(n,k) = ∑_{1 <= x₁, x₂, ..., x_k <= n} n/gcd(x₁, x₂, ..., x_k, n). A372968

Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 515", based on the 5-celled von Neumann neighborhood. A288828

a(n) = 4ⁿ - 2ⁿ - 1. A156589