8945
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10740
- Proper Divisor Sum (Aliquot Sum)
- 1795
- 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
- 7152
- Möbius Function
- 1
- Radical
- 8945
- 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
- 47
- Smith Number
- no
- 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
- If x and y are terms, so is x*y + 9.at n=41A009350
- Numbers k such that the continued fraction for sqrt(k) has period 15.at n=40A020354
- a(n) = number of (s(0),s(1),...,s(n)) such that every s(i) is a nonnegative integer, s(0) = 1, s(n) = 4, |s(1) - s(0)| = 1, |s(i) - s(i-1)| <= 1 for i >= 2. Also a(n) = T(n,n-3), where T is the array in A026120.at n=8A026125
- a(n) = ceiling(sqrt(8*10^n)).at n=6A035075
- Recip transform of 2*(1 + x^2 + x^5)-1/(1-x).at n=11A049156
- Digitally balanced numbers in both bases 2 and 3.at n=26A049361
- Row sums of triangle A060924 (odd part of bisection of Lucas triangle).at n=5A060927
- a(n) = A064837(n)/2.at n=9A064838
- a(0) = 1; for n>0, a(n) = 1 + coefficient of x^n in expansion of 1/Product_{ n >= 2, n not of the form 2^k-1 } (1-x^n).at n=52A078658
- Output of the linear congruential pseudo-random number generator rand() used in Microsoft's Visual C++.at n=17A096558
- Indices of primes in sequence defined by A(0) = 17, A(n) = 10*A(n-1) - 23 for n > 0.at n=22A102016
- TrueSoFar terminating terms in other bases.at n=8A102843
- Least inverse of A114912, or -1 if no inverse exists.at n=19A115251
- Prime numbers concatenated with 45.at n=23A137521
- Number of 0..n arrays x(0..6) of 7 elements with zero 5th differences.at n=13A200085
- Number of (w,x,y) with all terms in {0,...,n} and |w-x|+|x-y|+|y-w| != w+x+y.at n=20A213485
- Number of n-node unlabeled rooted trees with thinning limbs and root outdegree (branching factor) 7.at n=12A244708
- Triangle read by rows: T(n,k) is the coefficient A_k in the transformation of 1 + x + x^2 + ... + x^n to the polynomial A_k*(x+2k)^k for 0 <= k <= n .at n=52A248829
- Number of (n+2) X (3+2) 0..3 arrays with every 3 X 3 subblock row and column sum equal to 0 1 3 6 or 7 and every 3 X 3 diagonal and antidiagonal sum not equal to 0 1 3 6 or 7.at n=4A252187
- Number of (n+2)X(5+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 1 3 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 0 1 3 6 or 7.at n=2A252189