Properties of the Number 7952

Seven Thousand Nine Hundred Fifty-Two

Basics

Value: 7951 → 7952 → 7953

Parity: even

Prime: No

Previous Prime: 7951

Next Prime: 7963

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 ⁴ × 7 × 71

Divisors: 1, 2, 4, 7, 8, 14, 16, 28, 56, 71

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1111100010000

Octal: 17420

Duodecimal: 4728

Hexadecimal: 1f10

Square: 63234304

Square Root: 89.17398723843182

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) = |{m : multiplicative order of 6 mod m=n}|. A59888

Number of subsets of {1..n} containing n and some element equal to the sum of two other (possibly equal) elements. A365070

Number of nonnegative solutions of x1² + x2² + ... + x8² = n. A45850

Integer part of square root of n-th Fibonacci number. A61287

Molien series for complete weight enumerators of self-dual codes over Z/8Z containing the all-ones vector. A92545

Number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 49", based on the 5-celled von Neumann neighborhood. A270014

Consider sequence of fractions A066657/A066658 produced by ratios of terms in A066720; let m = smallest integer such that all fractions 1/n, 2/n, ..., (n-1)/n have appeared when we reach A066720(m) = k; sequence gives values of m; set a(n) = -1 if some fraction i/n never appears. A66849

Largest number not the sum of n distinct nonzero squares. A129210

Monotonic ordering of nonnegative differences 10ⁱ-2^j, for 40>= i>=0, j>=0. A192125

Consider the graph with one central vertex connected to three outer vertices (a star graph). Then, a(n) is the minimum number of moves required to transfer a stack of n pegs from one outer vertex to another outer vertex, moving pegs to adjacent vertices, following the rules of the Towers of Hanoi. A291876