9302
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13956
- Proper Divisor Sum (Aliquot Sum)
- 4654
- 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
- 4650
- Möbius Function
- 1
- Radical
- 9302
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 34
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 96.at n=4A031594
- Triangle T(n,k) (n >= 1, 0<=k<=n) giving number of preferential arrangements of n things beginning with k (transposed, then read by rows).at n=25A054255
- Numbers which retain their position in A073666 (position not disturbed by the rearrangement).at n=37A073667
- Triangle read by rows: T(n,k) = number of preferential arrangements of n things where the first object has rank k.at n=23A090665
- a(n) = (1/n!)*A001565(n).at n=20A094792
- a(1) = a(2) = 1. a(n) = a(n-1) + (largest nonprime {1 or composite} among the first n-2 terms of the sequence).at n=22A120760
- Row sums of A163233 and A163235 divided by 3.at n=34A163478
- Composite x such that [(x-1)' + (x+1)'] / x' is an integer, where x' is the arithmetic derivative of x.at n=3A246769
- a(n) = 10*n^2 + 10*n + 2.at n=30A273366
- Solution of the complementary equation a(n) = 2*a(n-1) - a(n-3) + b(n-1), where a(0) = 1, a(1) = 3, a(2) = 5, b(0) = 2, b(1) = 4, b(2) = 6, and (a(n)) and (b(n)) are increasing complementary sequences.at n=14A295614
- Number of subsets of {1..n} of which every subset has a different sum.at n=22A325864
- Number of unlabeled rooted trees with n vertices and more than two branches of the root.at n=13A331233
- a(1)=1, a(2)=4, and thereafter a(n) = a(n-2) + k * a(n-1), with minimal k >= 1 such that a(n) is not prime.at n=11A374055
- Row sums of A376168.at n=35A376169