4974
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 9960
- Proper Divisor Sum (Aliquot Sum)
- 4986
- 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
- 1656
- Möbius Function
- -1
- Radical
- 4974
- 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
- 72
- Smith Number
- yes
- 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
- Numbers k such that k^4 can be written as a sum of four positive 4th powers.at n=30A003294
- Numbers k such that Fibonacci(k) == 8 (mod k).at n=39A023177
- Expansion of g.f. 1/((1-x)*(1-6*x)*(1-8*x)*(1-9*x)).at n=3A023954
- 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=26A031544
- Number of partitions satisfying (cn(0,5) = 0 and cn(2,5) <= cn(1,5) and cn(3,5) <= cn(1,5) and cn(2,5) <= cn(4,5) and cn(3,5) <= cn(4,5)).at n=42A036806
- Coordination sequence T3 for Zeolite Code MTF.at n=42A057306
- Numbers which are the sum of their proper divisors containing the digit 8.at n=2A059467
- Numbers k such that k^4 can be written as a sum of four distinct positive 4th powers.at n=30A096739
- Reversible Smith numbers, i.e., Smith numbers whose reversal is also a Smith number.at n=36A104171
- Write the natural numbers as an infinite sequence of digits, starting at the left; a(n) is the subset (i.e., the position in this sequence of the "counting digits") of the first digit of the n-th square.at n=38A105314
- a(n) = a(n-1)+4*a(n-2)-4*a(n-4).at n=12A107385
- Least positive k such that k * [RSA-200]^n - 1 is prime, where RSA-200 is the 200 decimal digit RSA challenge number A391940(15).at n=27A108375
- Minimal value of sum(p(i)p(i+1),i=1..n), where p(n+1)=p(1), as p ranges over all permutations of {1,2,...,n}.at n=29A110611
- Triangle read by rows, generated from (..., 5, 3, 1).at n=49A112351
- Numbers k such that 7^k + 2 is semiprime.at n=18A119720
- Largest number k for which the n-th prime is the median of the largest prime dividing the first k integers.at n=29A126283
- a(n) = 2*n^2 + 16*n + 6.at n=45A154590
- Partial sums of [A052938(n)^2].at n=35A162899
- Smith numbers of order 2.at n=19A174460
- Numbers k for which order of Tate-Shafarevich group Ш of the elliptic curve y^2=x^3+k is 9.at n=38A179129