5207
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5376
- Proper Divisor Sum (Aliquot Sum)
- 169
- 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
- 5040
- Möbius Function
- 1
- Radical
- 5207
- 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
- 103
- 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(1) = 2; a(n+1) = a(n)-th nonprime, where nonprimes begin at 1.at n=29A025003
- Multiplicity of highest weight (or singular) vectors associated with character chi_145 of Monster module.at n=37A034533
- A038025(n)=1.at n=52A038032
- a(n) = A047980(2n).at n=41A047981
- Number of mobiles (circular rooted trees) with n nodes and 7 leaves.at n=5A055345
- Indices of primes in sequence defined by A(0) = 33, A(n) = 10*A(n-1) + 43 for n > 0.at n=10A056255
- Composite n such that sigma(n)-phi(n) divides sigma(n)+phi(n).at n=41A061367
- Nonprime numbers n such that q=phi(n)/(sigma(n)-n-1) is an integer and n is not a prime square.at n=34A070161
- Least m such that P - m is prime, where P is the n-th perfect number.at n=17A078097
- a(1)=1; thereafter, a(n+1) = a(n) + 2^(prime(n)-1).at n=6A080355
- Sum of 1-bits between the most and least significant bits summed for all primes in range ]2^n,2^(n+1)].at n=12A095298
- Numbers that reach the fixed point 89 under iteration of f(x) = reverse(x) - maxdigit(x).at n=5A097155
- The first pair of digits sums up to 7. So does the second pair. And the third one and the fourth one, etc., with a(n) < a(n+1). When constructing the sequence, choose the next digits so as to slow the growth of the sequence as much as possible.at n=58A101325
- Semiprimes n such that 3*n + 4 is a square.at n=17A112666
- Low point in segment n of A079051.at n=31A117518
- Positions of records in A034694.at n=37A120857
- Concatenation of first two digits and last two digits of n-th Mersenne prime A000668(n).at n=28A138863
- a(n) = n*(3*n + 4).at n=41A140676
- Composite terms in A143578.at n=33A142591
- a(n) = A142590(n)/3.at n=41A142883