Properties of the Number -263

Two Hundred Sixty-Three

Basics

Value: -264 → -263 → -262

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 263

Divisors: 1, 263

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: -100000111

Octal: -407

Duodecimal: -19B

Hexadecimal: -107

Square: 69169

Square Root: 16.217274740226856

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

Generalized Gaussian Fibonacci integers. A88137

Coefficients of the '6th-order' mock θ function λ(q). A53272

a(n) = -n² + 9·n + 23. A126719

Dirichlet inverse of Čiurlionis sequence, A342002. A342417

Second differences of A000463; first differences of A188652. A188653

G.f. satisfies: A(x) = (1 - x) * ∏_k>0 A(x^2·k) / ∏_k>1 A(x^2·k-1). A321326

Smallest error in trying to solve n³ = x³ + y³. That is, for each n, find positive integers x <= y < n such that | n³ - x³ - y³ | is minimal and let a(n) := n³ - x³ - y³. A135998

G.f.: ∑_n>=0 xⁿ * (1 - xⁿ)ⁿ. A260180

a(0)=0; thereafter a(n) = a(n-1)+n if the (n-1)st digit of the sequence is even, otherwise a(n) = a(n-1)-n. A309216

∏_n>=1 (1 + a(n)*xⁿ) = 1 + ∑_n>=1 σ(n)*xⁿ, where σ = A000203. A353924