Properties of the Number -32609

Thirty-Two Thousand Six Hundred Nine

Basics

Value: -32610 → -32609 → -32608

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 32609

Divisors: 1, 32609

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -111111101100001

Octal: -77541

Duodecimal: -16A55

Hexadecimal: -7f61

Square: 1063346881

Square Root: 180.5796223276591

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

a(n) = 10·b₁₀(n) + 9, where b₁₀ lists the indices of zeros of the sequence A261310: u(n) = abs(u(n-1) - gcd(u(n-1), 10n-1)), u(1) = 1. A186263

a(n) = prime(100·n). A31921

Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 502", based on the 5-celled von Neumann neighborhood. A282685

Primes p such that 32p+1 and (p-1)/32 are both prime. A86476

Partial sums of primes, but with a twist. A247657

Primes p such that p+2, p*(p+2) + 12 and p*(p+2) + 14 are also prime. A130736

Define f_i as the i-th iterate of A260187. a(n) is the least prime for which f_i(a(n)) is prime for all i such that 0 <= i < n and f_n(a(n)) is not prime. A258937

Primes p such that 4·p+3, 6·p+5 and 8·p+7 are all primes. A329551

Primes p such that p²+q+r, p+q²+r and p+q+r² are all prime, where q and r are the next two primes after p. A348353