Properties of the Number -69904

Sixty-Nine Thousand Nine Hundred Four

Basics

Value: -69905 → -69904 → -69903

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 ⁴ × 17 × 257

Divisors: 1, 2, 4, 8, 16, 17, 34, 68, 136, 257

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -10001000100010000

Octal: -210420

Duodecimal: -34554

Hexadecimal: -11110

Square: 4886569216

Square Root: 264.39364591457183

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(1) = 1, a(2n) = 16a(n), a(2n+1) = a(2n)+1. A33052

Poincaré series for invariant polynomial functions on the space of binary forms of degree 14. A293939

a(n) = n⁴ + n³ + n² + n. A27445

Solution of the complementary equation a(n) = 2·a(n-1) + a(n-2) + b(n-2), where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, and (a(n)) and (b(n)) are increasing complementary sequences. A295141

E.g.f. is inverse function to y -> integral from 0 to y of exp(-s²). A26944

Binomial transform of A171372. A171373

a(n) = (2^n² - 1)/(1 - 1/2ⁿ). A275779

Number of monic irreducible polynomials of degree 1 in GF(2ⁿ)[x1,x2,x3,x4]. A115500

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

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