Properties of the Number -40136

Forty Thousand One Hundred Thirty-Six

Basics

Value: -40137 → -40136 → -40135

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ³ × 29 × 173

Divisors: 1, 2, 4, 8, 29, 58, 116, 173, 232, 346

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1001110011001000

Octal: -116310

Duodecimal: -1B288

Hexadecimal: -9cc8

Square: 1610898496

Square Root: 200.33971149025845

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

Let p = A002145(n) be the n-th prime == 3 (mod 4); a(n) is the multiplicative order of 2+-i modulo p in Gaussian integers. A385165

Irregular triangle read by rows: T(n,k) = ∑_i=0..k (-1)ⁱ * binomial(4·n+1,i) * binomial(k+4-i,4)ⁿ, 0 <= k <= 4*(n-1). A236463

Number of rucksack compositions of n: every distinct partial run has a different sum. A354580

Draw a regular n-gon and the enclosing circle, then for each pair of vertices X, Y, draw a circle with diameter XY; the union of these figures is the graph H_n; sequence gives number of regions in H_n. A370978

Smallest multiple of the n-th prime beginning with n. A78209

Number of permutations of 4 indistinguishable copies of 1..n with exactly 2 adjacent element pairs in decreasing order. A151640

Triangle in which the g.f. for row n is (1-x)^4·n+1 * ∑_j>=0 binomial(n+j-1,j)⁴ * x^j, read by rows of k=0..3·n terms. A262014

Numbers k such that k*∑_d∣k 1/σ(d) is an integer. A69166