11127
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14840
- Proper Divisor Sum (Aliquot Sum)
- 3713
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7416
- Möbius Function
- 1
- Radical
- 11127
- Omega Function (Ω)
- 2
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 117
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Powers of fifth root of 6 rounded down.at n=26A018129
- Powers of fifth root of 6 rounded to nearest integer.at n=26A018130
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 70.at n=27A031568
- Triangle T(n,k) giving number of fixed 3 X k polyominoes with n cells (n >= 3, 1<=k<=n-2).at n=51A059679
- Row sums of triangle A091604.at n=20A091610
- Numbers n such that the product of digits of n equals the concatenation of pi(d)'s where d runs through the digits of n.at n=10A097228
- Numbers n such that P(4n) is prime, where P(m) is the number of partitions of m.at n=36A111045
- Except for the first term the number in the sequence is the smallest number in a new cycle of a RATS sequence with a new destiny. The first term is the best analog of this for the "infinite cycle".at n=6A161592
- Numbers in cycles of RATS sequences.at n=14A161596
- Lexicographically earliest increasing sequence which lists the positions of the zero digits in the sequence.at n=20A167519
- Numbers k such that 9k+4 are terms in A072841.at n=27A175518
- Sum of numbers in the n-th antidiagonal of the reciprocity array of 2.at n=35A259580
- Numerator of the probability that Alice wins the following game: Alice and Bob take turn (Alice starts first) to gain 1 or 2 chips randomly and independently with 1/2 chance, and the first player that collects at least n chips is the winner.at n=7A265920
- The number of tilings of an equilateral triangle of side length n with k lozenges and n^2 - 2*k unit triangles. Triangle T(n, k) with n >= 1 and 0 <= k <= n*(n + 1)/2, read by rows.at n=28A273464
- Numbers in 2-cycles of RATS sequences.at n=4A275218
- Number of sets of exactly n positive integers <= n+5 having a square element sum.at n=34A281968
- Lexicographically earliest sequence of distinct terms such that a(n) is divisible by five and only five digits of a(n+1).at n=30A308609
- Number of tilings of an equilateral triangle of side length n with unit triangles (of side length 1) and exactly three unit "lozenges" or "diamonds" (also of side length 1).at n=5A326368
- Partial sums of A097988 (d_3(n)^2).at n=50A330570
- Admirable totient numbers: numbers that are equal to the sum of their iterated phi, with one of them taken with a minus sign.at n=38A335121