5111
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5400
- Proper Divisor Sum (Aliquot Sum)
- 289
- 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
- 4824
- Möbius Function
- 1
- Radical
- 5111
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 59
- 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
- a(n) = floor(tau*a(n-2)) + a(n-1) with a(0)=0 and a(1)=1.at n=16A005833
- Describe the previous term! (method B - initial term is 5).at n=2A022501
- a(n) = sum of the numbers between the two n's in A026366.at n=36A026369
- Numbers whose product of digits is prime.at n=38A028842
- a(0) = 0; for n>0, a(n) is the smallest number greater than a(n-1) which does not use any digit used by a(n-1).at n=31A030283
- Number of dyslexic rooted compound windmills with n nodes and leaves of 2 colors with no symmetries.at n=9A032257
- Numbers having three 1's in base 10.at n=31A043495
- Numbers whose base-4 representation contains exactly two 1's and four 3's.at n=18A045123
- Distinct odd numbers in the numerators of the 1/5-Pascal triangle (by row).at n=46A046624
- Distinct odd numbers in writing first numerator and then denominator of each element to the right of the central elements of the 1/5-Pascal triangle (by row).at n=47A046628
- T(n, k) = Sum_{j=k..n} binomial(n, j)*E1(j, j-k), where E1 are the Eulerian numbers A173018. Triangle read by rows, T(n, k) for 0 <= k <= n.at n=31A046802
- T(n, k) = Sum_{j=k..n} binomial(n, j)*E1(j, j-k), where E1 are the Eulerian numbers A173018. Triangle read by rows, T(n, k) for 0 <= k <= n.at n=32A046802
- a(n) = (n+1)*2^n - n.at n=9A048493
- Numbers n such that 123*2^n-1 is prime.at n=25A050587
- 4-magic series constant.at n=2A052461
- Birthday set of order 9: i.e., numbers congruent to +- 1 modulo 2, 3, 4, 5, 6, 7, 8 and 9.at n=33A057541
- a(1) = 1; for n>1, a(n) = smallest number with all odd digits giving a prime in concatenation with the previous terms.at n=32A069604
- Smallest integer >= 0 of the form x^4 - n^3.at n=24A070928
- (C(p^2,p)-p)/p^5 where p runs through the primes >= 5.at n=1A079687
- a(n) = 4*n^2 + 6*n + 1.at n=35A082108