Properties of the Number -34049

Thirty-Four Thousand Forty-Nine

Basics

Value: -34050 → -34049 → -34048

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 79 × 431

Divisors: 1, 79, 431, 34049

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1000010100000001

Octal: -102401

Duodecimal: -17855

Hexadecimal: -8501

Square: 1159334401

Square Root: 184.52371121349148

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

Array read by antidiagonals: T(m,n) = number of irredundant sets in the grid graph P_m X P_n. A286868

a(n) = Fibonacci(p) mod p², where p = prime(n). A236395

Number of involution pairs of graceful Prüfer codes on n vertices with one code in the first half and the other in the second half of the lexicographic order. A393154

Numbers k such that k = p+q = r+s with p·q = r·s = primorial number(A002110) (p·q) < (r·s). A57230

Expansion of g.f.: (1+2·x³+2·x⁶)/((1-x)*(1-x-x²+x³-x⁴-x⁵+x⁶)). A84683

Number of equal-length matchings of 2n uniformly spaced points on a circle. A381194

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 0), (-1, 1, -1), (0, 1, -1), (1, 0, 1)}. A148651

a(n) = 1+2*(d1 + 1)*(d2 + 1)*...*(dk + 1), where d1, d2, ..., dk are the prime factors of the n-th Fermat pseudoprime to base 2 A001567(n). A216646

Numbers k such that (8·10^k - 77)/3 is prime. A272929