11220
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 6
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 48
- Divisor Sum
- 36288
- Proper Divisor Sum (Aliquot Sum)
- 25068
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2560
- Möbius Function
- 0
- Radical
- 5610
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 5
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 86
- 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) is the smallest positive integer a for which there is an identity of the form a*n*x = Sum_{i=1..m} ai*gi(x)^n where a1, ..., am are in Z and g1(x), ..., gm(x) are in Z[x].at n=35A005729
- a(n)-th prime is sum of first k primes for some k.at n=25A020641
- a(n) is least k such that k and 5k are anagrams in base n (written in base 10).at n=10A023097
- a(n) = dot_product(1,2,...,n)*(6,7,...,n,1,2,3,4,5).at n=28A026046
- Character of extremal vertex operator algebra of rank 33/2.at n=4A028538
- Longest edge a of smallest (measured by the longest edge) primitive Euler bricks (a, b, c, sqrt(a^2 + b^2), sqrt(b^2 + c^2), sqrt(a^2 + c^2) are integers).at n=20A031173
- Numbers in which 0,1,2,3,4,5 all occur in base 6.at n=35A031947
- Number of ternary rooted trees with n nodes and height exactly 10.at n=16A036425
- T(n,n+3), array T as in A047030.at n=7A047038
- Digitally balanced numbers in base 6: equal numbers of 0's, 1's, ..., 5's.at n=35A049357
- Numbers that are divisible by exactly 5 different primes.at n=40A051270
- A064637 converted to factorial base.at n=10A064477
- a(n) = Sum_{k=1..n} sigma(k)*2^(n-k) where sigma(k) = A000203(k) is the sum of divisors of k.at n=11A066767
- Integers x such that for some integer y we have uphi(x) = uphi(y) = x-y, where uphi(n) = A047994(n) is the unitary totient function: If n = Product p_i^e_i, uphi(n) = Product (p_i^e_i - 1).at n=9A067739
- Numbers k such that the sign of core(k)-phi(k) is not equal to 2*mu(k)^2-1, where core(k) is the squarefree part of k.at n=15A070237
- Expansion of (1-x)^(-1)/(1+2*x-x^2-x^3).at n=12A077920
- Numbers k such that binomial(prime(k), k) is divisible by k^2.at n=30A081384
- Numbers n which are a proper multiple (>1) of A068505(n) (= n read in base m+1 where m = largest digit of n).at n=28A089584
- Number of configurations of a variant of the 3-dimensional 3 X 3 X 3 sliding cube puzzle that require a minimum of n moves to be reached, starting with the empty space at the center of one of the 6 faces of the combination cube.at n=9A091521
- Numbers n such that primitive solutions for 1/n^2 = 1/x^2 + 1/y^2 exist.at n=31A094807