Properties of the Number -7672

Six Hundred Seventy-Two

Basics

Value: -7673 → -7672 → -7671

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ³ × 7 × 137

Divisors: 1, 2, 4, 7, 8, 14, 28, 56, 137, 274

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1110111111000

Octal: -16770

Duodecimal: -4534

Hexadecimal: -1df8

Square: 58859584

Square Root: 87.58995376183276

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 sin(tanh(x))*x. A9525

Number of integer partitions of n into relatively prime parts that are all greater than 1. A302698

Number of integer partitions of n whose product is a perfect power. A320322

Number of regions formed in a square by straight line segments when connecting the n-1 points between each corner that divide each edge into n equal parts to the n-1 points on the edge on the opposite side of the square. A355798

Triangular matchstick numbers in the class of prime numbers: sum of n-th and next n primes. A105720

Fourth partial sums of sixth powers (A001014). A254645

Triangle read by rows: T(n,k) = number of nonequivalent dissections of an n-gon into k polygons by nonintersecting diagonals up to rotation. A295633

Triangle read by rows: Each row is constructed by forming the partial sums of the previous row, reading from the right and at every other row repeating the final term. A99959

Number of maximal subsets of {1..n} containing no sums of distinct elements. A326498

a(n) = 4ⁿ + 10·2ⁿ + 4·3ⁿ + 20. A254366