9656
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 19440
- Proper Divisor Sum (Aliquot Sum)
- 9784
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 4480
- Möbius Function
- 0
- Radical
- 2414
- Omega Function (Ω)
- 5
- 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
- a(n) = n*(n + 1)*(n^2 - 3*n + 5)/6.at n=16A006484
- Self-convolution of natural numbers >= 3.at n=33A023551
- Total number of parts in all partitions of n into prime parts.at n=50A084993
- Sum of the first n twin prime pairs.at n=24A086169
- Values of k such that floor(k*tanh(Pi)) = floor((k+1) tanh(Pi)).at n=35A096613
- Sum of the components of twin prime pairs less than the 10^n-th prime.at n=1A118493
- G.f. satisfies: A(x) = C(2x)*A(x^3*C(2x)^4), where C(x) is the g.f. of the Catalan numbers (A000108).at n=6A120916
- Pairs (j, k) of numbers j<k such that phi(j) = phi(k), sigma(j) = sigma(k), d(j) = d(k).at n=34A134922
- 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, 1), (0, 1, -1), (0, 1, 0), (1, 0, -1), (1, 1, 1)}.at n=7A150618
- Numbers k such that k / (A000005(k)*(A000005(k)+1)/2) is an integer.at n=38A160921
- Least common multiple of prime(n)-3 and prime(n)+3.at n=33A166011
- a(n) = n*(n+1)*(14*n-11)/6.at n=16A172076
- Number of rhombuses on a (n+1)X8 grid.at n=37A190096
- Let S be a string of n 2's and 3's, with curling number k, which means S = XY^k where k is maximized; a(n) = number of S for which X must be taken to be the empty string.at n=29A216951
- Number of (n+1) X (n+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 6, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=2A235231
- Number of (n+1) X (3+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 6, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=2A235234
- T(n,k) is the number of (n+1) X (k+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 6, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=12A235239
- Number of prime factors in A052129(n).at n=14A238496
- Numbers whose abundance is a power of 2.at n=38A259174
- Numbers that occur only once in A155043; positions of zeros in A262505, ones in A262507.at n=30A262508