9698
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 32
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15708
- Proper Divisor Sum (Aliquot Sum)
- 6010
- 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
- 4464
- Möbius Function
- -1
- Radical
- 9698
- 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
- 21
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 11.at n=9A031599
- Sum of digits = 8 times number of digits.at n=36A061425
- Numbers k such that 4*10^k + 6*R_k + 1 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=21A099017
- (prime(n)*(prime(n+1)-1) + (prime(n)-1)*prime(n+1)) / 2.at n=23A099909
- a(n) = floor(sqrt(a(n-1)^2 + a(n-2)^2)), a(1)=100, a(2)=300.at n=16A104908
- Number of generalized compositions of n: words b_1^{i_1}b_2^{i_2}...b_k^{i_k} such that b_j's and j_i's are positive integers and sum b_j*i_j = n.at n=11A129921
- Even composites in A145832 with at least three distinct prime factors.at n=4A145916
- 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, 0, 1), (0, 1, -1), (0, 1, 0), (1, 0, 0)}.at n=8A149957
- Numbers that are the product of 3 distinct primes a,b and c, such that a^2+b^2+c^2 is the average of a twin prime pair.at n=43A176879
- Number of n X 6 binary arrays without the pattern 0 1 diagonally, vertically or antidiagonally.at n=40A188863
- Number of nX6 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 1 1 vertically.at n=4A207587
- T(n,k) = Number of n X k 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 1 1 vertically.at n=49A207589
- Number of 5 X n 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 1 1 vertically.at n=5A207592
- a(n) = Least integer k such that A249431(k) = n, and -1 if no such integer exists.at n=20A249430
- Number of irredundant sets in the path graph P_n.at n=16A286887
- Triangle read by rows: a(n,k) is the number of k X n matrices which are the first k rows of an alternating sign matrix of size n.at n=32A297622
- G.f. A(x) satisfies: A(x) = Product_{k>=1} 1/(1 - x^k*A(x)^k)^k.at n=7A301455
- a(n) is the smallest number k such that Sum_{j=1..k} (-1)^omega(j) = -n, where omega(j) is the number of distinct primes dividing j.at n=23A346456
- Least k such that A000668(n) - k is prime, where A000668(n) is the n-th Mersenne prime.at n=25A365161
- Numbers k such that !k * k! + 1 = A003422(k) * A000142(k) + 1 = A061640(k) + 1 is prime.at n=15A376644