9435
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 16416
- Proper Divisor Sum (Aliquot Sum)
- 6981
- 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
- 4608
- Möbius Function
- 1
- Radical
- 9435
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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) = n*(21*n-1)/2.at n=30A022278
- Numbers whose set of base-8 digits is {2,3}.at n=37A032808
- In A015922, not in A033553.at n=21A033554
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 8 skipped primes.at n=46A050775
- Values of r such that N(r)/r^2 > Pi, where N(r) is the number of integer lattice points (x,y) inside or on a circle of radius r.at n=44A093832
- Primitive elements of A119432.at n=17A119433
- Odd interprimes divisible by 17.at n=29A124620
- Numbers of the form 26+p^2 (where p is a prime).at n=24A138689
- Odd squarefree numbers n such that the cyclotomic polynomial Phi(n,x) has height 5.at n=25A152943
- Numbers k such that k-4, k-2, k+2 and k+4 are prime.at n=11A173037
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2 + (x+289)^2 = y^2.at n=10A207059
- Number of partitions p of n that are separable by the 2*min(p); see Comments.at n=50A239516
- Triangle read by rows: T(n,k) (n>=1, 1 <= k <= n) = number of alternating anagrams on n letters (of length 2n) which are decomposable into at most k slices.at n=30A239894
- Partial sums of A253086.at n=45A255150
- Numbers divisible by prime(d) for each digit d in their base-8 representation, none of which may be zero.at n=48A256878
- Numbers k > 0 such that either 3*k+4, k-2, k+2, n+k or 3*k+5, k-1, k+1, k+5 are all primes.at n=34A290130
- The number of length 2n - 1 strings over the alphabet {0, 1} such that the first half of any initial odd length substring is a permutation of the second half.at n=19A297789
- Squarefree integers m > 1 such that if prime p divides m, then the sum of the base p digits of m is at least p.at n=54A324315
- a(n) is the least number k such that the average number of odd divisors of {1..k} is >= n.at n=4A338891
- a(n) = (9*n/4 - 51/8 - 5/(16*n-24) + 1/n + 6/(n+1))*binomial(2*n-2,n-1).at n=4A344728