Properties of the Number -40929

Forty Thousand Nine Hundred Twenty-Nine

Basics

Value: -40930 → -40929 → -40928

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 7 × 1949

Divisors: 1, 3, 7, 21, 1949, 5847, 13643, 40929

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1001111111100001

Octal: -117741

Duodecimal: -1B829

Hexadecimal: -9fe1

Square: 1675183041

Square Root: 202.30916934237064

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

Integers k such that 10^k+19 is a prime number. A108052

Number of primes <= A214756(n). A214924

Expansion of e.g.f. sinh(log(1+x)*exp(x)). A9581

a(n) = [ a(n-1)/a(1) ] + [ a(n-3)/a(3) ] + [ a(n-5)/a(5) ] + ..., for n >= 3. A22872

Number of (n+1) X 4 0..1 arrays with the number of rightwards and downwards edge increases in each 2 X 2 subblock equal to the number in all its horizontal and vertical neighbors. A206262

Number of length 3+3 0..n arrays with some disjoint pairs in every consecutive four terms having the same sum. A247535

Triangle read by rows: T(n, k) = ∑_i=1..n-k qStirling1(n-k, i) * qStirling2(n-1+i, n-1) for 0 < k < n with initial values T(n, 0) = 0ⁿ and T(n, n) = 1 for n >= 0, here q = 2. A355282