Properties of the Number -4263

Two Hundred Sixty-Three

Basics

Value: -4264 → -4263 → -4262

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 7 ² × 29

Divisors: 1, 3, 7, 21, 29, 49, 87, 147, 203, 609

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1000010100111

Octal: -10247

Duodecimal: -2573

Hexadecimal: -10a7

Square: 18173169

Square Root: 65.2916533716217

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

G.f.: exp( ∑_n>=1 A002129(n²)*xⁿ/n ), where A002129(n) is the excess of sum of odd divisors of n over sum of even divisors of n. A225925

Exponential transform of Stirling1 triangle A008275. A55924

Triangle read by rows. The triangle algorithm applied to (-1)ⁿ/n!. A363732

Expansion of (η(q)³*η(q¹⁰)⁶)/(η(q²)²*η(q⁵)⁷) in powers of q. A113977

a(n) = ∑_k=1..n ∑_z=1..n ∑_y=1..n ∑_x=1..n [GCD(f(x,y,z), n) = k] * f(x,y,z) * A023900(k), where f(x,y,z) = x² + y² - z². A373582

Fluctuations of the number of biquadrate integers not exceeding 10ⁿ. A375247

Number of partitions of 4n into 4 parts. A238340

Numbers k such that k | 5^k + 1. A15951

Numbers m such that there are precisely 9 groups of order m. A249552

a(n) = n*(2 + 5·n). A168668