9663
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
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12888
- Proper Divisor Sum (Aliquot Sum)
- 3225
- 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
- 6440
- Möbius Function
- 1
- Radical
- 9663
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 184
- 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
- no
- Odd
- yes
Appears in sequences
- In the '3x+1' problem, these values for the starting value set new records for highest point of trajectory before reaching 1.at n=13A006884
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = A001950 (upper Wythoff sequence).at n=33A024864
- '3x+1' record-setters (blowup factor).at n=9A025587
- 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 31.at n=38A031529
- Initial number for record sum of numbers in trajectory of 3x+1 problem.at n=30A033495
- a(1) = 9; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=46A046259
- Position of first occurrence of 2^n in A057923.at n=20A057925
- Position at which 2^n occurs in A057926, or -1 if it does not occur.at n=21A057928
- Numbers n such that (n+j) mod (2+j) = 1 for j from 0 to 5 and (n+6) mod 8 <> 1.at n=11A096024
- Indices of primes in sequence defined by A(0) = 67, A(n) = 10*A(n-1) - 63 for n > 0.at n=16A101518
- Numbers n such that 2^n+25229 is prime.at n=53A103148
- Apocalypse primes: 10^665+a(n) has 666 decimal digits and is prime.at n=6A115983
- Numbers k such that k and k^2 use only the digits 3, 5, 6, 7 and 9.at n=6A137133
- Number of n X n arrays of the minimum value of corresponding elements and their horizontal or vertical neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..1 n X n array.at n=8A219497
- Least number whose Collatz (3x+1) trajectory has a number greater than 10^n.at n=7A222291
- Least number whose Collatz 3x+1 trajectory contains a number >= 2^n.at n=23A222292
- Least number whose Collatz 3x+1 trajectory contains a number >= 2^n.at n=24A222292
- Numbers n such that the decimal expansions of both n and n^2 have 3 as the digit with the smallest value and 9 as the digit with the largest value.at n=8A238553
- Numbers n such that 12*14^n-1 is prime.at n=15A273522
- Least semiprime of a run of exactly n odd semiprimes.at n=11A304457