8925
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 17856
- Proper Divisor Sum (Aliquot Sum)
- 8931
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 3840
- Möbius Function
- 0
- Radical
- 1785
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 96
- 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
- Odd abundant numbers (odd numbers m whose sum of divisors exceeds 2m).at n=19A005231
- Odd primitive abundant numbers.at n=14A006038
- Witt vector *2!/2!.at n=9A006177
- Table T(n,k), n>=0 and k>=0, read by antidiagonals: the k-th column given by the k-th Narayana polynomial.at n=59A008550
- q-factorial numbers for q=4.at n=4A015002
- Numbers k such that phi(k + 8) | sigma(k) + 8.at n=8A015873
- dot product (n,n-1,...2,1).(3,4,...,n,1,2).at n=32A026054
- n is odd and sum of digits of n equals the numbers of divisors of n.at n=38A057532
- McKay-Thompson series of class 44c for Monster.at n=50A058683
- Number of different lattice paths running from (0,0) to (n,0) using steps from S = {(k,k) or (k,-k): k positive integer} that never go below the x-axis.at n=6A059231
- Triangle read by rows: T(n,k) = Sum_{j=0..k-1} T(n,j) + Sum_{j=1..n-k} T(n-j,k), with T(0,0)=1 and T(n,k) = 0 for k > n.at n=27A059450
- Number of 4-block ordered tricoverings of an unlabeled n-set.at n=33A060488
- Odd numbers which can be written in precisely one way as sum of a subset of their proper divisors.at n=0A065235
- Odd values arising in A066820.at n=4A066852
- a(n)=phi(n^2+1)/n if (n^2+1) is composite and phi(n^2+1)==0 (mod n).at n=23A067926
- Array of q-factorial numbers n!_q, read by ascending antidiagonals.at n=40A069777
- q-factorial numbers 4!_q.at n=4A069779
- Barely abundant numbers: abundant n such that sigma(n)/n < sigma(m)/m for all abundant numbers m<n, sigma(n) being the sum of the divisors of n.at n=12A071927
- Odd numbers m whose abundance by absolute value is at most 10, that is, -10 <= sigma(m) - 2m <= 10.at n=10A077374
- a(n) is the smallest number k such that A033880(k)= n, or 0 if no such number exists, where A033880 is the abundance of k.at n=6A082731