8591
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
- 9576
- Proper Divisor Sum (Aliquot Sum)
- 985
- 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
- 7700
- Möbius Function
- 0
- Radical
- 781
- 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
- 78
- 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
- no
- Odd
- yes
Appears in sequences
- Number of partitions of n that do not contain 1 as a part.at n=42A002865
- Reverse digits of number of partitions of n.at n=25A004089
- a(n) = floor(exp(8/15)*n!).at n=6A030911
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 17 ones.at n=5A031785
- Composite numbers whose prime factors contain no digits other than 1 and 7.at n=29A036307
- Digitally balanced numbers in both bases 2 and 3.at n=15A049361
- Number of partitions of n including 3, but not 1.at n=44A085811
- Number of partitions of n into parts not less than the smallest prime factor of n.at n=41A097360
- Structured disdyakis dodecahedral numbers (vertex structure 5).at n=10A100163
- Numbers k such that 11k = 6j^2 + 6j + 1.at n=22A106388
- a(n) = |b(n)| where b(n) = -b(n-1) + 6*b(n-3) with b(0)=0, b(1)=1, b(2)=1.at n=15A107786
- a(n) = (p-1)! mod p^2 where p = n-th prime.at n=40A112660
- Number of partitions of n with unique smallest part and unique largest part.at n=41A117298
- a(1) = 1; thereafter a(n) is always the smallest integer > a(n-1) not leading to a contradiction, such that any four consecutive digits in the sequence sum up to a prime.at n=45A152604
- Bisection (even part) of number of partitions that do not contain 1 as a part A002865.at n=21A182746
- a(n) = (7*n^4 + 5*n^2)/12.at n=10A185505
- Number of partitions of n that do not contain parts less than the smallest part of the partitions of n-1.at n=41A187219
- Constant term of the reduction by x^2->x+1 of the polynomial p(n,x) defined below in Comments.at n=15A192752
- Number of (w,x,y,z) with all terms in {0,...,n} and (least gapsize)<2.at n=10A212896
- a(n) = p^2*(p^2+2*p-1)/2, where p = prime(n).at n=4A229738