9638
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
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14880
- Proper Divisor Sum (Aliquot Sum)
- 5242
- 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
- 4680
- Möbius Function
- -1
- Radical
- 9638
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 122
- 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
- yes
- Odd
- no
Appears in sequences
- Number of fixed n-celled self-avoiding polygons on square lattice.at n=8A006724
- Coordination sequence for CaF2(1), Ca position.at n=33A009923
- Least number of Sort-then-add persistence n.at n=31A033863
- Least number of Sort-then-add persistence n.at n=31A033908
- Number of partitions of n such that cn(0,5) = cn(2,5) <= cn(3,5) = cn(4,5) < cn(1,5).at n=59A036847
- Numbers whose base-4 representation contains exactly three 1's and four 2's.at n=17A045104
- Second partial sums of A001891.at n=11A053809
- Trajectory of 1001 under "3x+1" map.at n=20A100709
- Number of Ramanujan primes R_k such that 2^(n-1) < R_k <= 2^n.at n=19A190501
- G.f.: Sum_{n>=0} x^n * (1+x)^A003188(n), where A003188(n) = n XOR [n/2] is the Gray code for n.at n=16A227526
- Nonnegative integers n such that in balanced ternary representation the number of occurrences of each trit doubles when n is squared.at n=30A257867
- Partial sums of A263614 starting at n=2.at n=32A263615
- Number of maximal matchings in the n-prism graph.at n=11A284703
- a(n) is the least k > 0 such that A318928(k) = n.at n=8A319103
- Records in A318928.at n=7A319417
- Sorted positions of first appearances in A329867 (difference between the runs-resistance and the cuts-resistance of binary expansion) of each element in the image.at n=18A329868
- Triangle read by rows: T(n,k) is the number of k-regular graphs on n unlabeled nodes with half-edges.at n=60A333161
- Number of n-regular graphs on 2n unlabeled vertices with half-edges.at n=5A333166
- a(n) = Sum_{d|n} phi(d) * prime(d).at n=48A333558
- The number of even prime gaps g, satisfying g == 4 (mod 6), out of the first 2^n even prime gaps.at n=15A341532