Properties of the Number 7968

Seven Thousand Nine Hundred Sixty-Eight

Basics

Value: 7967 → 7968 → 7969

Parity: even

Prime: No

Previous Prime: 7963

Next Prime: 7993

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 2 ⁵ × 3 × 83

Divisors: 1, 2, 3, 4, 6, 8, 12, 16, 24, 32

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 1111100100000

Octal: 17440

Duodecimal: 4740

Hexadecimal: 1f20

Square: 63489024

Square Root: 89.26365441768559

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

18-gonal (or octadecagonal) numbers: a(n) = n*(8·n-7). A51870

Number of parts > 1 in the last section of the set of partitions of n. A138135

Sum of all the parts in the partitions of 4n into 4 parts. A238328

Minimal number of people to give a 50% probability of having at least n coincident birthdays in one year. A14088

T(n,k) gives the number of permutations of the set [n] that contain k occurrences of the subword (132); irregular array read by rows (n >= 0 and 0 <= k <= max(0, floor((n-1)/2))). A197365

a(n) = Frobenius number for 3 successive primes = F[p(n), p(n+1), p(n+2)]. A138989

Second differences of Mersenne primes A000668. A139232

Square array A(n,k), n>=1, k>=1, read by antidiagonals, with A(1,k)=1 and sequence a_k of column k shifts left when Dirichlet convolution with a_k (DC:(b,a_k)->a) applied k times. A144823

a(n) = 14·n² - 4·n. A195023

Array read by antidiagonals: T(n,k) is the number of permutations of k indistinguishable copies of 1..n with exactly 2 local maxima. A334773