Properties of the Number -4639

Six Hundred Thirty-Nine

Basics

Value: -4640 → -4639 → -4638

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 4639

Divisors: 1, 4639

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1001000011111

Octal: -11037

Duodecimal: -2827

Hexadecimal: -121f

Square: 21520321

Square Root: 68.11020481543129

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. A(x) satisfies: A(x) = 1 / (1 - x + x⁴ * A(x)). A349048

a(n) = 6·n³ - 263·n² + 3469·n - 12841. A218457

First member of a prime triple in a 2p-1 progression. A57326

Number of different score sequences that are possible in an n-team round-robin tournament. A571

Primes congruent to 31 mod 32. A127578

Primes p such that p + 4 is prime and p == 9 (mod 10). A74822

Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[4, 6, 2]; short d-string notation of pattern = [462]. A78851

Primes such that the sum of the predecessor and successor primes is divisible by 29. A112859

Primes p such that 3·p-4, 3·p-10, and 3·p-14 are all prime. A230223

Number T(n,k) of unlabeled rooted trees with n nodes such that the minimal outdegree of inner nodes equals k; triangle T(n,k), n>=1, 0<=k<=n-1, read by rows. A244454