Properties of the Number 9746

Nine Thousand Seven Hundred Forty-Six

Basics

Value: 9745 → 9746 → 9747

Parity: even

Prime: No

Previous Prime: 9743

Next Prime: 9749

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 2 × 11 × 443

Divisors: 1, 2, 11, 22, 443, 886, 4873, 9746

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10011000010010

Octal: 23022

Duodecimal: 5782

Hexadecimal: 2612

Square: 94984516

Square Root: 98.72183142547549

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

Number of 9's in all partitions of n. A24793

T(n,k) = Number of (n+2) X (k+2) binary arrays avoiding patterns 000 and 101 in rows, columns and nw-to-se diagonals. A202532

Number of strict trees of weight n with distinct leaves. A300352

T(n,k) = Half the number of n X k binary arrays with the number of 1-1 horizontal, vertical, diagonal and antidiagonal adjacencies equal to the number of 0-0 adjacencies. A183289

Numbers whose binary representation traces a non-selfcrossing circuit in the honeycomb lattice when each one of its bits, from the most significant to the least significant, is interpreted as a direction to proceed at each vertex. A255561

Number of colored integer partitions of n such that two colors are used and parts differ by size or by color. A327380

a(n) is the least number whose fifth power is an n-digit fifth power which has the maximum sum of digits (A374025(n)). A379650

a(n) = k is the largest k for which k⁵ is n digits long and the sum of digits of k⁵ is the maximum for any n digit 5th power (A374025). A380566

a(n) = n*(1 + n)*(3 - 4·n + 4·n²)/6. A213840

Number of ways to partition the multiset consisting of n copies each of 1, 2, and 3 into n sets of size 3. A254233