5118
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10248
- Proper Divisor Sum (Aliquot Sum)
- 5130
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 1704
- Möbius Function
- -1
- Radical
- 5118
- 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
- 116
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) is the solution to the postage stamp problem with 6 denominations and n stamps.at n=11A001211
- G.f.: (1 + x^3 + x^4 + ... + x^12 + x^15)/Product_{i=1..10} (1 - x^i).at n=25A003403
- Number of restricted 3 X 3 matrices with row and column sums n.at n=37A005045
- Coordination sequence T4 for Zeolite Code VNI.at n=44A009910
- a(n) = floor(binomial(n,4)/4).at n=28A011850
- Numbers k such that the continued fraction for sqrt(k) has period 48.at n=41A020387
- In base 11, a(n) = sum of digits of Lucas(a(n)).at n=42A025491
- 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 46.at n=33A031544
- Numbers k such that 99*2^k+1 is prime.at n=35A032399
- Numbers k such that 229*2^k+1 is prime.at n=9A032491
- Numerators of continued fraction convergents to sqrt(373).at n=4A041706
- a(n) = 5*2^n - 2.at n=10A051633
- a(3) = 1, otherwise a(n) = n*2^(n-3) - 2^(n-2) - 2.at n=9A058966
- Number of primes between n^4 and (n+1)^4.at n=25A061235
- Nearest integer to (Product(n^((1 + log(i))/i^2), {i, 1, n})).at n=34A062483
- a(n) = (9*n^2 + 13*n + 6)/2.at n=33A064226
- Group the composite numbers so that the sum of the n-th group is a multiple of the n-th prime: (4), (6), (8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22), (24, 25), (26, 27, 28, 30, 32), (33, 34, ...), ... Sequence gives the first term of each group.at n=45A074125
- Multiples of 6 in which there is no common digit in successive terms.at n=21A083494
- Antidiagonal sums of square table A086623.at n=11A086625
- Let p(n) be the n-th prime congruent to 1 mod 4. Then a(n) = the least m for which m^2+1=p(n)*k^2 has a solution.at n=34A094048