10696
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 23040
- Proper Divisor Sum (Aliquot Sum)
- 12344
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4560
- Möbius Function
- 0
- Radical
- 2674
- 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
- 47
- 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
- Numbers k such that k | 7^k + 7.at n=25A015893
- Triangle of coefficients of polynomials enumerating trees with n labeled nodes by inversions.at n=52A052121
- Centered 23-gonal numbers.at n=30A069174
- Number of ways to get ten-pin bowling score of 300-n.at n=44A079596
- Triangle read by rows: T(n,k) is the number of Motzkin paths of length n having k ascents (0<=k<=floor(n/2)); an ascent is a maximal string of upsteps.at n=53A114580
- Numbers k such that k and k^2 use only the digits 0, 1, 4, 6 and 9.at n=27A136862
- 4 times 9-gonal numbers: a(n) = 2*n*(7*n-5).at n=28A152760
- Upper s-Wythoff sequence, where s=A081276 (eighth cubes). Complement of A184431.at n=42A184432
- Number of nondecreasing arrangements of n+2 numbers in 0..6 with the last equal to 6 and each after the second equal to the sum of one or two of the preceding four.at n=39A189323
- a(n) = Sum_{k=0..n} binomial(n, k)*|S1(n, k)|.at n=6A211210
- Number of (n+1) X (4+1) 0..3 arrays with the minimum plus the upper median equal to the lower median plus the maximum in every 2 X 2 subblock.at n=4A235889
- Number of (n+1) X (5+1) 0..3 arrays with the minimum plus the upper median equal to the lower median plus the maximum in every 2 X 2 subblock.at n=3A235890
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the minimum plus the upper median equal to the lower median plus the maximum in every 2X2 subblock.at n=31A235893
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the minimum plus the upper median equal to the lower median plus the maximum in every 2X2 subblock.at n=32A235893
- Number of compositions of n such that the sum of the parts counted without multiplicities is equal to the sum of all multiplicities.at n=18A243149
- Sum of the major index over all standard Young tableaux with n cells.at n=8A247386
- Numbers n such that the smallest prime divisor of n^2+1 is 101.at n=36A248553
- Number of (n+1)X(5+1) 0..1 arrays with every 2X2 subblock ne-sw antidiagonal difference unequal to its neighbors horizontally and nw+se diagonal sum unequal to its neighbors vertically.at n=8A253695
- Number of (n+2) X (n+2) 0..1 arrays with no 3 X 3 subblock diagonal sum 0 and no antidiagonal sum 3 and no row sum 0 or 3 and no column sum 0 or 3.at n=13A258958
- a(n) = p(2*n)-p(2*n-2)-p(n) where p(n) are the partition numbers A000041(n).at n=19A263847