9447
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
- 8
- Divisor Sum
- 13056
- Proper Divisor Sum (Aliquot Sum)
- 3609
- 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
- 6072
- Möbius Function
- -1
- Radical
- 9447
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 153
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- a(n) = floor(binomial(n,8)/8).at n=19A011854
- Convolution of (1, p(1), p(2), ...) and composite numbers.at n=21A023627
- Quasi-Carmichael numbers to base -3: squarefree composites n such that for every prime p that divides n, p+3 divides n+3.at n=5A029563
- Denominators of continued fraction convergents to sqrt(217).at n=9A041405
- a(1) = 3; for n > 1, choose a(n) to be the smallest number such that a(n) > a(n-1) and (a(n)*a(n-1)+1) mod (a(n)+a(n-1)+1) = 0.at n=7A064457
- a(n) is the number of terms in the expansion of (x+y+z)*(x^2+y^2+z^2)*(x^3+y^3+z^3)*...*(x^n+y^n+z^n).at n=15A086796
- Row sums of the number triangle A098505.at n=20A098506
- Starting numbers for which the RATS sequence has eventual period 14.at n=25A114615
- Riordan array (1/(1-3x*c(x)),xc(x)), c(x) the g.f. of A000108.at n=38A117375
- a(n) = (p(n)*p(n+1)-p(n+2))/2, where p(n) is the n-th odd prime.at n=31A152527
- a(1)=15; for n>1, a(n) = the smallest number k >a(n-1) such that 2*A174214(k)= 3*(k-1).at n=9A174216
- Number of ordered triples (w,x,y) with all terms in {1,...,n} and w^3 >= x^3 + y^3.at n=32A211651
- Sum of smallest parts of all partitions of n into an even number of parts.at n=35A222045
- Somos's sequence {b(7,n)} defined in comment in A078495: a(0)=a(1)=...=a(16)=1; for n>=17, a(n)=(a(n-1)*a(n-16)+a(n-8)*a(n-9))/a(n-17).at n=39A271954
- Numbers k such that k, k + 1 and k + 2 are all norm-deficient in Gaussian integers (A332572).at n=32A332574
- Products p*q*r of three distinct primes such that (p*q) mod r, (p*r) mod q and (q*r) mod p are all prime.at n=10A338704