Properties of the Number 9152

Nine Thousand One Hundred Fifty-Two

Basics

Value: 9151 → 9152 → 9153

Parity: even

Prime: No

Previous Prime: 9151

Next Prime: 9157

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ⁶ × 11 × 13

Divisors: 1, 2, 4, 8, 11, 13, 16, 22, 26, 32

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10001111000000

Octal: 21700

Duodecimal: 5368

Hexadecimal: 23c0

Square: 83759104

Square Root: 95.66608594481119

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 log-concave compositions (ordered partitions) of n. A69916

Number of rooted bicubic maps: a(n) = (8·n-4)*a(n-1)/(n+2) for n >= 2, a(0) = a(1) = 1. A257

Intermediate edge b of smallest (measured by the longest edge) primitive Euler bricks (a, b, c, sqrt(a² + b²), sqrt(b² + c²), sqrt(a² + c²) are integers). A31174

Triangle T(n,k) = C_n(k) where C_n(k) = number of k-colored labeled graphs with n nodes (n >= 1, 1<=k<=n). A58843

Products of the 6th power of a prime and 2 distinct primes (p⁶*q·r). A179672

Values of n such that there are exactly 10 solutions to x² - y² = n with x > y >= 0. A257417

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with no 3x3 subblock diagonal sum less than the antidiagonal sum. A256771

Number of partitions of n having population standard deviation < 2. A238658

T(n,k)=Number of nXk 0..1 arrays with no 1 equal to more than one of its horizontal and vertical neighbors, with the exception of exactly one element. A283042

Triangle read by rows: T(n,k) is the number of rooted hypermaps of genus k with n darts. A321710