11464
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 21510
- Proper Divisor Sum (Aliquot Sum)
- 10046
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5728
- Möbius Function
- 0
- Radical
- 2866
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 2
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
- 29
- 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) = (d(n)-r(n))/5, where d = A026043 and r is the periodic sequence with fundamental period (0,2,3,0,0).at n=52A026045
- a(n) = A076795(n) - 1.at n=6A099953
- Number of monic irreducible polynomials over GF(4) of degree <= n.at n=7A114946
- Triangle read by rows: T(n,k) is the number of permutations p of {1,2,...,n} such that the set {|p(i)-i|, i=1,2,...,n} has exactly k elements (1<=k<=n).at n=53A125183
- Triangle read by rows: T(n,k) (n>=0, k=0..n) gives number of connected graphs on n nodes with edge chromatic number k.at n=49A126732
- Number of connected graphs on n nodes with edge chromatic number 4.at n=8A126734
- Table T(n,k) read by antidiagonals. T(n,k) is the number of primitive (=aperiodic) k-ary Lyndon words (n,k >= 1) with length less than or equal to n.at n=62A143328
- a(n)=floor(3*n^2*(2+sqrt(3))).at n=31A172526
- Number of 2 X 2 matrices with all terms in {0,1,...,n} and (sum of terms) = n+2.at n=37A210374
- Number of (w,x,y,z) with all terms in {0,...,n} and (least gapsize)<2.at n=11A212896
- Triangle read by rows: number of k-ary n-tuples (a_1,..,a_n) such that the string a_1...a_n is preprime.at n=31A215474
- Number of (n+1)X(5+1) arrays of permutations of 0..n*6+5 with each element having directed index change -1,1 0,-1 0,1 or 1,0.at n=3A264503
- T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change -1,1 0,-1 0,1 or 1,0.at n=31A264506
- Number of (4+1) X (n+1) arrays of permutations of 0..n*5+4 with each element having directed index change -1,1 0,-1 0,1 or 1,0.at n=4A264510
- Numbers that are the largest value in the Collatz (3x+1) trajectories of exactly six initial values.at n=45A274467
- Subword complexity of a the infinite word Prod_{i>=1} Prod_{j=1..i} a^j b^(i-j+1).at n=41A338761
- Number of n-dimensional representations of the group SU(3).at n=46A346159
- Number of ways to tile a 3-row trapezoid of average length n with triangular and rectangular tiles, each of size 3.at n=11A375823