9795
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 30
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15696
- Proper Divisor Sum (Aliquot Sum)
- 5901
- 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
- 5216
- Möbius Function
- -1
- Radical
- 9795
- 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
- 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
- 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
- Number of partitions into non-integral powers.at n=20A000158
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = (odd natural numbers).at n=21A024592
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = (odd natural numbers).at n=20A025106
- 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=39A031529
- Numbers that are the product of 3 prime factors whose concatenation is a palindrome.at n=25A046452
- Least k such that decimal representation of k*n contains only digits 0 and 3.at n=33A096682
- Partial sums of A000960.at n=32A099074
- Number of compositions of n into parts of sizes == 1 mod 5 or 4 mod 5.at n=24A116975
- Product of successive primes minus 2.at n=24A124669
- a(n) = number of solutions to an equation x_1 + ... + x_j =0 with 1<=j<=n satisfying -n<=x_i<=n (1<=i<=j).at n=4A160492
- a(0)=a(1)=1, a(n) = least k > a(n-1) such that k*a(n-2) is a triangular number.at n=30A214961
- a(n) is the conjectured highest power of n which has no four identical digits in succession.at n=7A216065
- Numbers k such that (k+1)^(k-1) + k is prime.at n=9A238378
- Intersection of A269315 and A269314.at n=36A269316
- Products of three distinct tribonacci numbers > 1.at n=29A274434
- Partial sums of A299285.at n=15A299286
- Numbers k such that A003132(k^2) = A003132(k), where A003132(n) is the sum of the squares of the digits of n.at n=44A309883
- a(n) = 1*2 - 3 + 4*5 - 6 + 7*8 - 9 + 10*11 - 12 + 13*14 - ... + (up to n).at n=43A319493
- Numbers that are the sum of ten fourth powers in ten or more ways.at n=26A345603
- Numbers that are the sum of ten fourth powers in exactly ten ways.at n=18A345862