Properties of the Number -36767

Thirty-Six Thousand Seven Hundred Sixty-Seven

Basics

Value: -36768 → -36767 → -36766

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 36767

Divisors: 1, 36767

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1000111110011111

Octal: -107637

Duodecimal: -1933B

Hexadecimal: -8f9f

Square: 1351812289

Square Root: 191.74722944543424

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

Primes having only {3, 6, 7} as digits. A260380

a(1) = 1, a(2) = 2; a(n+1) = 2n·a(n) - a(n-1). Symmetrically, a(n) = (a(n-1) + a(n+1))/((n-1) + (n+1)). A93985

Minimal order of degree-n irreducible polynomials over GF(29). A218364

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where A(n,k) is ∑_{j=0..floor(n/2)} ((n-j)!/j!)*binomial(n-j,j)*k^n-2·j*(-1)^j. A305466

Consecutive pairs of prime point sums in A161191 (includes triples). A161192

n·10³-1, n·10³-3, n·10³-7 and n·10³-9 are all prime. A64977

Odd primes of the form (1+n)*(2+2·n)+n*(3+2·n) = 4·n²+7·n+2. A171749

Number of multisets of nonempty words with a total of n letters over binary alphabet containing the second letter such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter. A293797

Primes of the form ∑_k=1..n φ(prime(k)). A101302

Primes of the form 15·k² - 15·k + 17. A220081