Properties of the Number -40108

Forty Thousand One Hundred Eight

Basics

Value: -40109 → -40108 → -40107

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 37 × 271

Divisors: 1, 2, 4, 37, 74, 148, 271, 542, 1084, 10027

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1001110010101100

Octal: -116254

Duodecimal: -1B264

Hexadecimal: -9cac

Square: 1608651664

Square Root: 200.2698179956231

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

Coefficients in the expansion of 1/([r] + [2r]x + [3r]x² + ...); [ ] = floor, r = sqrt(2). A279587

Numbers k such that prime(k+1) == 1 (mod k). A105286

Expansion of g.f. A(x) satisfying A(x) = x + A(A(x))² - A(A(x))³. A190761

The smallest positive integer that produces a product that contains the digit 2 when multiplied by 2 a total of n times. A381087

a(n) = the smallest positive integer that produces a product that contains the digit 2 when multiplied by 2 at most n times, and where a further multiplication by 2 produces a number that does not contain the digit 2. Set a(n) = -1 if no such number exists. A381183

The distinct values, in order of appearance, of A381087. A378138

Number of binary strings of length n with equal numbers of 00000 and 00010 substrings. A164179

a(n) = a(n-2) + 2·a(n-3), n > 3; with a(0)=0, a(1)=1, a(2)=2, a(3)=0. A134271

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), (0, 1, -1), (1, 0, -1), (1, 1, 0), (1, 1, 1)}. A150760