5014
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7920
- Proper Divisor Sum (Aliquot Sum)
- 2906
- 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
- 2376
- Möbius Function
- -1
- Radical
- 5014
- 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
- 41
- 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
- Absolute value of Glaisher's alpha(n).at n=18A002290
- Numbers that are the sum of 7 positive 7th powers.at n=20A003374
- Nonsquare values of m in the discriminant D = 4*m leading to a new maximum of the L-function of the Dirichlet series L(1) = Sum_{k>0} Kronecker(D,k)/k.at n=28A003421
- Coordination sequence T3 for Zeolite Code MFI.at n=45A008166
- Number of ferrites M_{10}Y_n that repeat after 6n+50 layers.at n=11A011964
- Expansion of sec(arcsinh(x) + tan(x)) (coefficients of even powers only).at n=3A013101
- Numbers k such that the continued fraction for sqrt(k) has period 76.at n=5A020415
- a(n) = n*(19*n - 1)/2.at n=23A022276
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 36 ones.at n=15A031804
- a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049727.at n=37A049739
- a(n) = Sum_{i=0..floor(n/2)} T(2i,n-2i), array T as in A049747.at n=31A049750
- Sum of remainders when n-th prime is divided by all preceding integers.at n=38A050482
- (1/2)*(n^2+n+2)*(n^2+3*n+1).at n=9A058310
- McKay-Thompson series of class 52a for Monster.at n=55A058707
- Consider the version of the Collatz or 3x+1 problem where x -> x/2 if x is even, x -> (3x+1)/2 if x is odd. Define the stopping time of x to be the number of steps needed to reach 1. Sequence gives the number of integers x with stopping time n.at n=31A060322
- Number of distinct differences between consecutive divisors of n! (ordered by size).at n=17A060737
- Numbers k such that sigma(k+2) = sigma(k+1) + sigma(k).at n=5A104149
- Molien series for a certain 16-dimensional group of order 10321920.at n=11A105319
- n(k) is the minimum number of n that need at least another number of k to make Prime[n]+2*Prime[n-k]a prime.at n=40A114232
- Molecular topological indices of the path graphs P_n.at n=19A121318