11077
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
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12960
- Proper Divisor Sum (Aliquot Sum)
- 1883
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9360
- Möbius Function
- -1
- Radical
- 11077
- Omega Function (Ω)
- 3
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 68
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Number of ordered 5-tuples of integers from [ 1,n ] with no common factors among quadruples.at n=15A015653
- Pseudoprimes to base 12.at n=34A020140
- Pseudoprimes to base 56.at n=40A020184
- Pseudoprimes to base 65.at n=39A020193
- Odd 10-gonal (or decagonal) numbers.at n=26A028993
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 4.at n=40A050036
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 4.at n=40A050052
- a(n) = a(n-1) + a(m) for n >= 3, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = 3.at n=40A050068
- Cupolar numbers: a(n) = (n+1)*(5*n^2 + 7*n + 3)/3.at n=18A096000
- Multiples of 11 containing an 11 in their decimal representation.at n=35A121031
- Odd interprimes divisible by 19.at n=30A126231
- a(n) = A144453(n)/16.at n=52A146537
- Coefficients of the sixth-order mock theta function psi_{-}(q).at n=27A153252
- Binomial transform of A109747.at n=12A153732
- a(n) = number of n-lettered words in the alphabet {1, 2, 3} with as many occurrences of the substring (consecutive subword) [1, 1, 2] as of [1, 1, 3].at n=9A211288
- Binomial(n-1,3)+3*binomial(n-1,4)+6*binomial(n-1,5)+5*binomial(n-1,6).at n=12A235593
- 10-gonal (or decagonal) numbers with prime indices.at n=15A267217
- Squarefree composite numbers n such that b^n == b (mod gpf(n)) for every integer b, where gpf(n) = A006530(n).at n=27A276832
- Number of 7 X n 0..1 arrays with every element equal to 0 or 1 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=13A301796
- Number of partitions such that the least positive integer which is not a part of the partition is prime.at n=36A305937