9398
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14592
- Proper Divisor Sum (Aliquot Sum)
- 5194
- 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
- 4536
- Möbius Function
- -1
- Radical
- 9398
- 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
- 83
- 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
- a(0) = 1, a(n) = 29*n^2 + 2 for n>0.at n=18A010019
- Number of partitions of n^2 into distinct squares.at n=40A030273
- Numbers whose base-5 representation contains exactly three 0's and two 3's.at n=29A045201
- Number of character table entries of the symmetric group S_n which are < 0.at n=14A051748
- Row sums of A095167.at n=25A095170
- Maximal value of sum(p(i)p(i+1),i=1..n), where p(n+1)=p(1), as p ranges over all permutations of {1,2,...,n}.at n=29A110610
- G.f. A(x) satisfies A(A(A(..(A(x))..))) = B(x) (8th self-COMPOSE of A) such that the coefficients of B(x) consist only of numbers {1,2,3,..,8}, with B(0) = 0.at n=5A112117
- Twice nonagonal numbers (or twice 9-gonal numbers): a(n) = n*(7*n-5).at n=37A139268
- Nonprimes in the triangle A141020.at n=23A141031
- Numbers k with the property that their basins (as defined in A204539) are 2.at n=23A185001
- Number of (strictly) 2-connected cubic graphs on 2n nodes.at n=8A204199
- Number of (n+1)X(1+1) 0..1 arrays x(i,j) with row sums sum{j*x(i,j), j=1..1+1} nondecreasing, and column sums sum{i*x(i,j), i=1..n+1} nondecreasing.at n=41A232825
- Permutation of natural numbers: a(n) = A243283(A122111((2*n)-1)).at n=35A244984
- a(n) = Position of 2^n among the numbers which are divisible by the square of their highest noncomposite factor (i.e., the union of {1} and A070003), 0 if not there.at n=20A244986
- Partial sums of A073602.at n=30A259035
- Number of partitions in which each summand, s, may be used with frequency f if f divides s.at n=48A296116
- Solution (a(n)) of the complementary equation a(n) = 2*a(n-1) - a(n-2) + b(n-1) + b(n); see Comments.at n=27A305330
- O.g.f. A(x) satisfies: Sum_{n>=1} (2^n*x - A(x))^n / n = 0.at n=3A306063
- Numbers k such that 385*2^k+1 is prime.at n=30A322998
- a(n) = prime(1+n)*A024451(n-1) - A024451(n), where A024451(n) is the numerator of Sum_{i = 1..n} 1/prime(i).at n=5A376419