Properties of the Number -4683

Six Hundred Eighty-Three

Basics

Value: -4684 → -4683 → -4682

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 7 × 223

Divisors: 1, 3, 7, 21, 223, 669, 1561, 4683

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1001001001011

Octal: -11113

Duodecimal: -2863

Hexadecimal: -124b

Square: 21930489

Square Root: 68.4324484437025

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

Triangle t(n,m)= binomial(n+m-1,n-1) + binomial(2·n-m-1,n-1) -binomial(2·n-1,n-1) read by rows, 0<=m<=n. A174952

Fubini numbers: number of preferential arrangements of n labeled elements; or number of weak orders on n labeled elements; or number of ordered partitions of [n]. A670

Exponential Riordan array [1, 1/(2-e^x)-1]. A256893

Number A(n,k) of lattice paths from {n}^k to {0}^k using steps that decrement one or more components by one; square array A(n,k), n>=0, k>=0, read by antidiagonals. A262809

Triangle of numbers T(n,k) (n>=0, n>=k>=0) of transitive reflexive early confluent binary relations R on n labeled elements where k=max_x(|{y : xRy}|), read by rows. A135313

Number T(n,k) of endofunctions on [n] such that at least one preimage with cardinality >=k exists and a nonempty preimage of j implies that all i<=j have preimages with cardinality >=k; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A245732

Values of n such that L(9) and N(9) are both prime, where L(k) = (n²+n+1)*2^2·k + (2·n+1)*2^k + 1, N(k) = (n²+n+1)*2^k + n. A226929

Array read by antidiagonals: generalized ordered Bell numbers Bo(r,n). A94416

Number T(n,k) of compositions of n where each part i is marked with a word of length i over a k-ary alphabet whose letters appear in alphabetical order and all k letters occur at least once in the composition; triangle T(n,k), n >= 0, 0 <= k <= n, read by rows. A261781

Triangle read by rows, T(n, k) = binomial(n, k) * ∑_j=0..n-k E(n-k, j)*2^j, where E(n, k) are the Eulerian numbers A173018(n, k), for 0 <= k <= n. A154921