11080
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 25020
- Proper Divisor Sum (Aliquot Sum)
- 13940
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4416
- Möbius Function
- 0
- Radical
- 2770
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 68
- 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
- First nontrivial or multidigital Armstrong number to base n.at n=21A016087
- Numbers that are divisible by 10 and are differences between two cubes in at least one way.at n=15A038854
- Numbers n such that 203*2^n-1 is prime.at n=12A050853
- Triangle T(n,k), 0<=k<=n, formed from coefficients when formula for n-th diagonal of triangle in A059718 is written as a sum of binomial coefficients.at n=43A059720
- Consider the sequence b(k) such that b(k) and sigma(b(k)) end with the same digit in base 10. Sequence gives values of b(k) such that b(k)/k = 10.at n=17A065255
- Triangle read by rows: T(n,k) is the number of alternating max-precedes-min permutations on [n+2] with 1 in position k+2, 0<=k<=n.at n=43A104346
- Numbers n such that p(3n) is prime, where p(n) is the number of partitions of n.at n=44A111389
- sigma(n) + n is a square.at n=25A114069
- Partial sums of ceiling(n^2/2) (A000982).at n=40A131941
- a(1)=1, a(n)=a(n-1)+n if n even, a(n)=a(n-1)+n^2 if n is odd.at n=39A136047
- 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), (-1, 1, 0), (0, 1, 1), (1, -1, 0), (1, 1, -1)}.at n=8A149048
- a(n) = (1+n)*(9 + 11*n + 4*n^2)/3.at n=19A172482
- a(2*n+1) = 1+A131941(2*n+1). a(2*n) = A131941(2*n).at n=39A173809
- Self-convolution of A180711.at n=31A180712
- Triangle read by rows: T(n,k) is the number of 2-compositions of n having least entry equal to k (n >= 1; 0 <= k <= floor(n/2)).at n=19A181365
- Number of 2-compositions of n containing at least one 0 entry. A 2-composition of n is a nonnegative matrix with two rows, such that each column has at least one nonzero entry and whose entries sum up to n.at n=7A181367
- a(n) = Sum_{k=0..n} C(n,k)*sigma(n+k) for n>=1.at n=8A181411
- Number of fixed points in all cycle-up-down permutations of {1,2,...,n}.at n=8A186365
- Maximum fixed points under iteration of sum of cubes of digits in base n.at n=22A226026
- Write n in binary and interpret as a decimal number; a(n) is this quantity minus n.at n=30A228071