Properties of the Number -40182

Forty Thousand One Hundred Eighty-Two

Basics

Value: -40183 → -40182 → -40181

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 37 × 181

Divisors: 1, 2, 3, 6, 37, 74, 111, 181, 222, 362

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1001110011110110

Octal: -116366

Duodecimal: -1B306

Hexadecimal: -9cf6

Square: 1614593124

Square Root: 200.45448361161692

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(n) = n*(n+1)*(5·n+1)/6. A33994

T(n,k) = number of n X k 0..2 arrays with rows, diagonals and antidiagonals unimodal and columns nondecreasing. A224262

Numbers equal to a permutation (or rearrangement) of the digits of the sum of their proper divisors. Rearrangements which cause leading zeros are excluded. A85844

T(n,e) is the number of unlabeled posets of n>=0 points with e>=0 arcs in the Hasse diagram, irregular triangle read by rows. A342447

Number of n X 6 0..2 arrays with rows, diagonals and antidiagonals unimodal and columns nondecreasing. A224260

Number of 3 X n 0..2 arrays with rows, diagonals and antidiagonals unimodal and columns nondecreasing. A224263

a(n) is the least integer k such that there are n values of i <= k for which gpf(i² + 1) = gpf(k² + 1), where gpf(x) is the greatest prime factor of x. A258840