9604
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 15
- Divisor Sum
- 19607
- Proper Divisor Sum (Aliquot Sum)
- 10003
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4116
- Möbius Function
- 0
- Radical
- 14
- Omega Function (Ω)
- 6
- 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
- yes
- 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
- 166
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- yes
- Achilles Number
- no
- Perfect Power
- yes
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- a(n+1) = 1 + a( floor(n/1) ) + a( floor(n/2) ) + ... + a( floor(n/n) ).at n=39A003318
- Numbers of form 2^i*7^j, with i, j >= 0.at n=40A003591
- Number of partitions of n into Fibonacci parts (with 2 types of 1).at n=37A007000
- Numbers n such that tau(sigma(n))= tau(tau(n)).at n=28A015730
- a(n) = (3n+2)^2.at n=33A016790
- a(n) = (4n + 2)^2.at n=24A016826
- a(n) = (5*n + 3)^2.at n=19A016886
- a(n) = (6*n + 2)^2.at n=16A016934
- a(n) = (7*n)^2.at n=14A016982
- a(n) = (8*n + 2)^2.at n=12A017090
- a(n) = (9*n + 8)^2.at n=10A017258
- a(n) = (10*n + 8)^2.at n=9A017366
- a(n) = (11*n + 10)^2.at n=8A017510
- a(n) = (12*n + 2)^2.at n=8A017546
- a(n) = n*(n-1)^4/2.at n=8A019583
- Expansion of Product (1-m*q^m)^-16; m=1..inf.at n=4A022740
- Numbers of form 4^i*7^j, with i, j >= 0.at n=21A025619
- Numbers with 15 divisors.at n=13A030633
- Every run of digits of n in base 6 has length 2.at n=38A033004
- Numbers whose prime factors are 2 and 7.at n=22A033847