Properties of the Number -6363

Three Hundred Sixty-Three

Basics

Value: -6364 → -6363 → -6362

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 7 × 101

Divisors: 1, 3, 7, 9, 21, 63, 101, 303, 707, 909

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1100011011011

Octal: -14333

Duodecimal: -3823

Hexadecimal: -18db

Square: 40487769

Square Root: 79.76841480184999

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

Expansion of e.g.f. (1 + y)^{1 + x}. A105793

Number of integer partitions of n whose length cannot be written as a nonnegative linear combination of the distinct parts. A367219

Inverse of a generalized Stirling number triangle of first kind. A105794

Triangle of generalized Stirling numbers of the first kind read by rows: T(n, k) = (-1)^n+k*∑_m=0..n Stirling1(n, m) * binomial(m, k), where Stirling1 is A048994. A94645

Least k such that the k-th prime number has exactly n ones in its binary expansion. A372517

3 times 12-gonal (or dodecagonal) numbers: a(n) = 3·n*(5·n-4). A153448

Number of heptagonal regions in regular n-gon with all diagonals drawn. A67154

Sum of reciprocals of digits = 1. A37268

S'_t(n) is the number of set partitions of {1,2,...,t} into exactly n parts such that no part contains both 1 and t or both i and i+1 for some i with 1 <= i < t; triangle S'_t(n), t >= 0, 0 <= n <= t, read by rows. A261139

Numbers n with digits 3 and 6 only. A284633