Properties of the Number -80145

Eighty Thousand One Hundred Forty-Five

Basics

Value: -80146 → -80145 → -80144

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 5 × 13 × 137

Divisors: 1, 3, 5, 9, 13, 15, 39, 45, 65, 117

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -10011100100010001

Octal: -234421

Duodecimal: -3A469

Hexadecimal: -13911

Square: 6423221025

Square Root: 283.0989226401259

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

Expansion of e.g.f. exp(x·exp(x)-x). A52506

a(n) = (2·n - 1)*(7·n² - 7·n + 6)/6. A63490

Square array T(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of e.g.f. exp(x^k * (exp(x) - 1)). A292892

Number of ways to write n as an ordered sum of ten powers of 2. A342254

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = n! * ∑_{j=0..floor(n/2)} k^j * Stirling2(n-j,j)/(n-j)!. A361652

Triangle read by rows: T(n,k) = number of partial idempotent mappings (of an n-chain) with collapse exactly k. A259759

Square array T(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of e.g.f. exp(x^k/k! * (exp(x) - 1)). A355650

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = n! * ∑_{j=0..floor(n/2)} k^n-j * Stirling2(n-j,j)/(n-j)!. A362839