5246
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 8184
- Proper Divisor Sum (Aliquot Sum)
- 2938
- 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
- 2520
- Möbius Function
- -1
- Radical
- 5246
- 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
- 103
- 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
- Number of bipartite partitions.at n=13A002763
- The sequence 2^(1-n)*a(n) is fixed (up to signs) by Stirling2 transform.at n=6A003633
- Number of n-node trees not determined by their spectra.at n=15A006610
- If a, b in sequence, so is ab+10.at n=27A009368
- Twelve iterations of Reverse and Add are needed to reach a palindrome.at n=35A015993
- Pisot sequence T(4,6), a(n) = floor(a(n-1)^2/a(n-2)).at n=26A020747
- Pisot sequence T(6,9), a(n) = floor(a(n-1)^2/a(n-2)).at n=25A020751
- n written in fractional base 8/5.at n=38A024647
- Every prefix prime in base 7 (written in base 7).at n=16A024767
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ], s = A000201 (lower Wythoff sequence).at n=27A025118
- Denominators of continued fraction convergents to sqrt(790).at n=8A042523
- Numbers n such that n | 10^n + 9^n + 8^n + 7^n + 6^n.at n=32A057252
- Numbers which need 12 'Reverse and Add' steps to reach a palindrome.at n=35A065217
- Counts where both the odd composites (starting from 1) 1 mod 4 and 3 mod 4 are equal.at n=6A093182
- a(n) is the smallest positive d such that the n-th prime is the smallest prime p for which p+d is also prime.at n=25A101042
- A101042 sorted. There exists a prime p for which a(n) is the smallest positive d such that p is the smallest prime where p+d is also prime.at n=22A101043
- d such that the smallest prime p for which p+d is also prime is larger than for any smaller d.at n=11A101046
- Cumulative sum of absolute values of coefficients of q^(2n) in the series expansion of Ramanujan's mock theta function f(q).at n=27A109471
- Even numbers k such that if a person is born in year k and lives not more than 100 years, then he never celebrates his prime birthday on a prime year.at n=0A124658
- Even composites in A145832.at n=31A145915