5511
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 8064
- Proper Divisor Sum (Aliquot Sum)
- 2553
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3320
- Möbius Function
- -1
- Radical
- 5511
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 129
- 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
- Coordination sequence T6 for Zeolite Code DDR.at n=47A008076
- Fibonacci sequence beginning 1, 14.at n=14A022104
- Numbers k such that 215*2^k+1 is prime.at n=6A032484
- Numbers whose set of base-12 digits is {2,3}.at n=25A032812
- Numbers n such that 229*2^n-1 is prime.at n=26A050866
- a(n) = floor(A*a(n-1) + B*a(n-2) + C)/p^r, where p^r is the highest power of p dividing floor(A*a(n-1) + B*a(n-2) + C), A=1.0001, B=1.0001, C=1, p=2.at n=40A053521
- a(n) = -a(n-1) - a(n-2) + a(n-3), a(0)=3, a(1)=-1, a(2)=-1.at n=26A073145
- Expansion of (3 + 2*x + 3*x^2)/(1 + x + 3*x^2 - x^3).at n=13A073496
- Successively larger 3-ball ground-state site swaps of A084501 in concatenated decimal notation.at n=25A084502
- Successively larger 3-ball indecomposable ground-state site swaps of A084511 in concatenated decimal notation.at n=10A084512
- Successively larger 3-ball 'prime' ground-state site swaps of A084521 in concatenated decimal notation.at n=9A084522
- Numerators of convergents of the continued fraction with the n+1 partial quotients: [1;1,1,...(n 1's)...,1,n+1], starting with [1], [1;2], [1;1,3], [1;1,1,4], ...at n=13A088209
- a(0)=0 and for n>0, a(n) is the smallest positive integer that cannot be derived by the adding or subtracting at most three terms with values in {a(0),...,a(n-1)} allowing repeats.at n=42A096077
- a(n) = ( Sum_{k=0..n} (-1)^(n-k)*binomial(n, k)*Bell(k) )*( Sum_{k=1..n} (k-1)!*binomial(n-1, k-1)*binomial(n, k-1) ).at n=4A100524
- Number of base-2 strong pseudoprimes (A001262) less than 2^n.at n=34A108797
- Number of partitions of n into 5-smooth parts.at n=32A112581
- Multiples of 11 containing an 11 in their decimal representation.at n=19A121031
- Number of integer-sided pentagons having perimeter n.at n=38A124285
- A doubly-fractal sequence. Erase the first (leftmost) digit of every integer: what is left is the sequence itself. The erased digits, one by one, form also the sequence itself.at n=27A127274
- Complete list of solutions to y^2 = x^3 - 207; sequence gives y values.at n=4A134106