9846
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 21372
- Proper Divisor Sum (Aliquot Sum)
- 11526
- 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
- 3276
- Möbius Function
- 0
- Radical
- 3282
- Omega Function (Ω)
- 4
- 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
- 73
- 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
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- The terms of A055235 (sums of two powers of 3) divided by 2.at n=47A073216
- a(n) = floor(5^n/3^n).at n=18A094974
- Diagonal sums of number triangle A109244.at n=8A109245
- a(n) = (5*n^3+12*n^2+n+6)/6.at n=22A114211
- Triangle read by rows: T(n,k) is the number of binary sequences of length n containing k subsequences 0011 (n,k>=0).at n=42A118884
- "666" in bases 7 and higher rewritten in base 10.at n=33A121205
- Triangle read by rows: T(n,k) is the number of nondecreasing Dyck paths of semilength n and having k double rises at an odd level (n >= 1, k >= 0).at n=45A121529
- a(0) = 0, a(1) = 1, a(2)=1; a(n) = 3a(n-1) + 3a(n-2) - 4a(n-3) for n >= 3.at n=9A123189
- Generalized Pascal triangle.at n=49A124216
- Generalized Pascal triangle.at n=50A124216
- Let M(n) = maximal value of (n/k)^k over all k = 1, 2, ...; a(n) = floor(M(n)).at n=24A139076
- Let M(n) = maximal value of (n/k)^k over all k = 1, 2, ...; a(n) = round(M(n)).at n=24A139077
- a(n) = n^2*(n^7+1)/2.at n=3A168125
- a(n) = largest number k such that k and k * n taken together have distinct digits, or 0 if no such k exists.at n=31A173780
- Even numbers that can only be expressed as the sum of two distinct twin prime pairs in two ways: n = p+(q+2) = (p+2)+q where (3,5) < (p,p+2) < (q,q+2).at n=73A179014
- Number of (n+1) X 2 binary arrays with rows and columns in nondecreasing order and with no 2 X 2 subblock sum differing from a horizontal or vertical neighbor subblock sum by more than one.at n=36A184063
- Riordan array ( (1/(1-x))^m , x*A000108(x) ), m = 3.at n=58A185944
- Triangle T(n,k) = coefficient of x^n in expansion of ((1-sqrt(1-4*x))/((1-x)*2))^k = sum(n>=k, T(n,k) * x^n).at n=47A200965
- Sigma(n)-n values in A085844.at n=9A216383
- Numbers of the form (3^j + 9^k)/2, for j and k >= 0.at n=36A226793