5186
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7782
- Proper Divisor Sum (Aliquot Sum)
- 2596
- 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
- 2592
- Möbius Function
- 1
- Radical
- 5186
- 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
- 41
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that phi(k) = phi(k+1).at n=15A001274
- Number of points on surface of octahedron; also coordination sequence for cubic lattice: a(0) = 1; for n > 0, a(n) = 4n^2 + 2.at n=36A005899
- Number of factorization patterns of polynomials of degree n over F_2.at n=22A006167
- Worst cases for Pierce expansions (numerators).at n=30A006537
- a(0) = 1, a(n) = 9*n^2 + 2 for n>0.at n=24A010002
- Coordination sequence for C_3 lattice: a(n) = 16*n^2 + 2 (n>0), a(0)=1.at n=18A010006
- Number of distinct products i*j*k with 1 <= i < j < k <= n.at n=45A027430
- 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 72.at n=0A031570
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 72.at n=1A031750
- Numerators of continued fraction convergents to sqrt(487).at n=5A041928
- Numerators of continued fraction convergents to sqrt(693).at n=4A042332
- a(n)=(s(n)+2)/9, where s(n)=n-th base 9 palindrome that starts with 7.at n=29A043078
- Squarefree numbers k such that phi(k) = phi(k+1).at n=8A063739
- Numbers k such that 1/(1/phi(k) + 1/phi(k+1) + 1/phi(k+2)) is an integer.at n=34A073543
- Numbers that are equal to the sum of their anti-divisors.at n=5A073930
- A014486-indices of binary trees whose left and right subtree are identical.at n=16A083938
- a(n) = n^3 - 2*n^2 + 2.at n=17A100109
- Number of partitions of n into relatively prime parts such that multiplicities of parts are also relatively prime.at n=30A100953
- Row sums of A102416.at n=11A103179
- a(n) = A113166(n) - Fibonacci(n-1), where Fibonacci(n) = A000045(n).at n=56A113486