9572
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 16758
- Proper Divisor Sum (Aliquot Sum)
- 7186
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4784
- Möbius Function
- 0
- Radical
- 4786
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 73
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Coordination sequence for Cr3Si, Si position.at n=25A009927
- Denominators of continued fraction convergents to sqrt(251).at n=9A041471
- Number of 3 X 3 integer matrices with elements in the range [ -n,n ] which represent a three-fold rotation.at n=2A053172
- Iccanobirt prime indices (12 of 15): Indices of prime numbers in A102122.at n=18A102142
- A014486-indices for the compact representation of Beanstalk-tree, with the lesser numbers coming to the left hand side.at n=9A218781
- Number of (n+2)X(3+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 1 3 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 1 3 6 or 7.at n=4A252152
- Number of (n+2)X(5+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 1 3 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 1 3 6 or 7.at n=2A252154
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 1 3 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 1 3 6 or 7.at n=23A252157
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 1 3 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 1 3 6 or 7.at n=25A252157
- Number of separable partitions of n in which the number of distinct (repeatable) parts is > 5.at n=40A325720
- Number of integer partitions of n whose parts minus 1 are relatively prime.at n=33A328170
- Numbers that are the sum of seven fourth powers in exactly four ways.at n=40A345826
- a(0) = 1; a(n) = Sum_{k=0..floor(n/4)} binomial(n-3*k,k) * a(k).at n=28A352041
- a(n) is the smallest number which can be represented as the sum of n distinct perfect powers (A001597) in exactly n ways, or -1 if no such number exists.at n=35A363040
- G.f. satisfies A(x) = 1 + x / (1 - x*A(x)^2)^2.at n=8A367236