Properties of the Number -2303

Three Hundred Three

Basics

Value: -2304 → -2303 → -2302

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 7 ² × 47

Divisors: 1, 7, 47, 49, 329, 2303

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -100011111111

Octal: -4377

Duodecimal: -13BB

Hexadecimal: -8ff

Square: 5303809

Square Root: 47.989582202807306

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

a(n) = (-1)ⁿ*n*(n-2). A131386

a(n) = 1 - n²*2ⁿ. A168298

Expansion of (1-x)^-1/(1+2·x-2·x³). A77924

Triangle read by rows: T(n, k) is the coefficient of x^k in the polynomial 1 - T_n(x)², where T_n(x) is the n-th Hermite polynomial of the Hochstadt kind (A137286) as related to the generalized Chebyshev in a Shabat way (A123583): p(x,n)=x·p(x,n-1)-p(x,n-2); q(x,n)=1-p(x,n)². A136667

a(n) = n*(n+2) = (n+1)² - 1. A5563

Number of partitions of n into at least two distinct parts. A111133

a(n) = 4·n² - 1. A466

a(n) = n² - 2·n. A67998

a(0) = 0, a(1) = 1 and a(n) = n² - 1 with n >= 2. A132411

Triangle read by rows: T(n,k) is the number of k-block partitions of an n-set up to rotations. A152175