9635
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12096
- Proper Divisor Sum (Aliquot Sum)
- 2461
- 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
- 7360
- Möbius Function
- -1
- Radical
- 9635
- 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
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) is the number of integers m which take n steps to reach 1 in '3x+1' problem.at n=41A005186
- a(n) = least number not of form [ (a^2/n) ] + [ (b^2)/n ].at n=20A036575
- Number of partitions satisfying 0 < cn(2,5) + cn(3,5).at n=33A039897
- The smallest magic constant for n X n magic square with prime entries (regarding 1 as a prime).at n=12A073502
- Number of first-quadrant Gaussian primes whose norm is less than 10^n.at n=4A091101
- Sum of smallest parts (counted with multiplicity) of all partitions of n.at n=24A092309
- G.f. satisfies: A(x) = Sum_{n>=0} x^n * A(x)^(n*(n+1)/2).at n=8A107591
- Sum of the first n n-digit primes less n*10^(n-1).at n=20A114053
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (0, 1, 0), (1, -1, 0), (1, -1, 1)}.at n=9A148649
- Diagonal sums of number triangle A185962.at n=41A185964
- Numbers k such that there are 2 primes between 100*k and 100*k + 99.at n=27A186394
- Numbers n not divisible by 2 or 3 such that k^k == k+1 (mod n) has no nonzero solutions.at n=42A191834
- Number of partitions of n avoiding equidistant 3-term arithmetic progressions.at n=50A238433
- Let f(p,i) = smallest prime m >= p such that m == i (mod p); a(n) = Sum_{i=0..p-1} f(p,i), where p = n-th prime.at n=14A243076
- Number of triple-crossings of diagonals in the regular 2n-gon.at n=13A260417
- Least number N such that the product n*N has the same digits as the concatenation (n,N) (counting repetitions), or 0 if no such number exists.at n=16A266578
- Solution of the complementary equation a(n) = a(n-1) + 2*a(n-2) + b(n-2), where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, and (a(n)) and (b(n)) are increasing complementary sequences.at n=12A295145