Properties of the Number -33409

Thirty-Three Thousand Four Hundred Nine

Basics

Value: -33410 → -33409 → -33408

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 33409

Divisors: 1, 33409

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1000001010000001

Octal: -101201

Duodecimal: -17401

Hexadecimal: -8281

Square: 1116161281

Square Root: 182.7812900709479

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 of form n² + 10000. A256838

a(n) is the smallest prime factor of nⁿ+1 having the form k·n+1. A187022

Number of trees of diameter 6. A251

Primes that remain prime through 3 iterations of function f(x) = 8x + 5. A23293

Let p_4,1(m) be the m-th prime == 1 (mod 4). Then a(n) is the smallest p_4,1(m) such that the interval(p_4,1(m)*n, p_4,1(m+1)*n) contains exactly one prime == 1 (mod 4). A210475

Primes of the form 384·k + 1. A229854

Primes of the form 256n+129. A105130

a(n) = 58·n² + 1. A158666

Primes of the form (p² - 1)/8 - p, where p is also a prime. A165567

Difference between π(10ⁿ) and nearest integer to (F[2n+1](S(n)))² where π(10ⁿ) = number of primes <= 10ⁿ (A006880), F[2n+1](x) are Fibonacci polynomials of odd indices [2n+1] and S(n) = ∑_i=0..2 (C(i)*(log(log(A*(B+n²))))²ⁱ) (see A227693). A227694