Properties of the Number -81081

Eighty-One Thousand Eighty-One

Basics

Value: -81082 → -81081 → -81080

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ⁴ × 7 × 11 × 13

Divisors: 1, 3, 7, 9, 11, 13, 21, 27, 33, 39

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -10011110010111001

Octal: -236271

Duodecimal: -3AB09

Hexadecimal: -13cb9

Square: 6574128561

Square Root: 284.74725635201474

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) = binomial(n+10, 10)*3ⁿ. A172362

Odd abundant numbers not divisible by 5. A64001

Dimensions of the irreducible representations of the simple Lie algebra of type F4 over the complex numbers, listed in increasing order. A121738

Number of ways to place 2 points on a triangular grid of side n so that they are not adjacent. A239568

Odd admirable numbers: such that σ(n) = 2n + 2d for some d | n. A109729

Numbers that are the sum of four third powers in ten or more ways. A345155

Lower triangular array called S2hat(-3) related to partition number array A144279. A144280

Primitive nondeficient numbers sorted by largest prime factor then by increasing size. Irregular triangle T(n, k), n >= 2, k >= 1, read by rows, row n listing those with largest prime factor = prime(n). A338133

a(n) = 3⁴ * binomial(n+3, 4). A102741

Triangle read by rows: T(n,k) = number of partitions of [1..k] into n nonempty clumps of sizes 1, 2, 3, 4 or 5 (n >= 0, 0 <= k <= 5n). A151338