9571
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10152
- Proper Divisor Sum (Aliquot Sum)
- 581
- 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
- 8992
- Möbius Function
- 1
- Radical
- 9571
- Omega Function (Ω)
- 2
- 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
- yes
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Number of restricted 3 X 3 matrices with row and column sums n.at n=44A005045
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 97.at n=18A031595
- Numbers whose set of base-9 digits is {1,4}.at n=39A032821
- Sums of 7 distinct powers of 3.at n=22A038469
- 19-gonal (or enneadecagonal) numbers: n(17n-15)/2.at n=34A051871
- Centered 22-gonal numbers.at n=29A069173
- a(1)=a(2)=a(3)=1. a(n) = reverseDigits(a(n-1)+a(n-2)+a(n-3)) for n>=4.at n=11A163550
- Composite numbers such that exactly ten distinct permutations of digits are prime.at n=34A163562
- Floor-Sqrt transform of numbers of A004148 (secondary structures).at n=24A192684
- Number of -n..n circular arrays x(0..4) of 5 elements with zero sums of x(i) and x(i)*x((i+1) mod 5).at n=44A202007
- Number of non-intersecting unit cubes regularly packed into the tetrahedron of edge length n.at n=44A219965
- The Wiener index of the graph obtained by applying Mycielski's construction to the path graph on n vertices (n>=2).at n=39A228321
- a(n) = number of steps to reach 0 when starting from k = n^3 and repeatedly applying the map that replaces k with k - A055401(k), where A055401(k) = the number of positive cubes needed to sum to k using the greedy algorithm.at n=43A261227
- Partial sums of A175317 (Sum_{d|n} pod(d)).at n=18A280114
- a(n) = 20*binomial(n,6) + 2*binomial(n,3) + 1.at n=11A341704
- Square array T(n,k), n >= 1, k >= 0, read by antidiagonals downwards, where T(n,k) = Sum_{j=1..n} (j * floor(n/j))^k.at n=61A356250
- G.f. satisfies A(x) = 1 + x * A(x)^(1/2) * (1 + A(x)^(5/2)).at n=6A370471
- a(n) is the smallest number which can be represented as the sum of four distinct nonzero n-gonal numbers in exactly n ways, or -1 if no such number exists.at n=12A374274
- Starting values of maximal runs of at least five integers, each with exactly two distinct prime factors.at n=42A383400