Properties of the Number -2363

Three Hundred Sixty-Three

Basics

Value: -2364 → -2363 → -2362

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 17 × 139

Divisors: 1, 17, 139, 2363

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -100100111011

Octal: -4473

Duodecimal: -144B

Hexadecimal: -93b

Square: 5583769

Square Root: 48.61069841094653

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

First term of the n-th differences of the composite numbers. Inverse zero-based binomial transform of A002808. A377036

G.f. A(x) satisfies: A(x) = 1 + x - x² * A(x/(1 - x)) / (1 - x). A346078

a(n) = a(n-1) - (n-4)*a(n-4), with a(0)=0, a(1)=1, a(2)=2, a(3)=1. A122049

Expansion of (1 + x + x²)/(1 - x² - 2·x³). A159288

Number T(n,k) of equivalence classes of ways of placing k 2 X 2 tiles in an n X n square under all symmetry operations of the square; irregular triangle T(n,k), n>=2, 0<=k<=floor(n/2)², read by rows. A236679

Super-3 Numbers (3n³ contains substring '333' in its decimal expansion). A14569

a(n) = n² + n + 11. A48058

Number of integer partitions of n with fewer parts than distinct divisors of parts. A371173

Largest side, in increasing order, of primitive integer-sided triangles with A < B < C < 2*π/3 and such that FA + FB + FC is an integer where F is the Fermat point of the triangle. A336332

Number of integer partitions of n with a unique 1 or prime part. A379314