4692
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 12096
- Proper Divisor Sum (Aliquot Sum)
- 7404
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1408
- Möbius Function
- 0
- Radical
- 2346
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- yes
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 121
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- a(n) = 2*n*(2*n+1).at n=34A002943
- a(n) = n*(n+1)*(n+2)*(n+7)/24.at n=16A005582
- Generalized Fibonacci numbers D_{n,3}.at n=14A006211
- Long leg of more than one primitive Pythagorean triangle.at n=42A024410
- a(n) = (-1 + prime(n+1)^2)/4.at n=31A024701
- Even numbers to the left of the central elements of the (1,2)-Pascal triangle A029635.at n=48A029647
- Denominators of continued fraction convergents to sqrt(177).at n=7A041327
- Numbers having four 2's in base 5.at n=32A043360
- Numbers k such that k^10 == 1 (mod 11^3).at n=35A056085
- McKay-Thompson series of class 12C for the Monster group.at n=10A058206
- Engel expansion of sinh(1).at n=34A068377
- "Sum of n first primes" minus "sum of first n nonprimes".at n=57A071411
- a(n) = the smallest positive number which furnishes a "one-line proof" for primality of prime(n), the n-th prime; i.e., the smallest k which is relatively prime to p such that k*(p+k) is divisible by every prime less than sqrt(p), where p=prime(n).at n=64A079900
- Quotient of LCM of prime(n+1)-1 and prime(n)-1 and GCD of the same two numbers.at n=32A083555
- Number of lattice points on or inside the rectangle formed by [1 <= x <= (q-1)/2] and [1 <= y <= (p-1)/2], where p = n-th prime, q = (n-1)-st prime.at n=31A087427
- Delete first column (index 0) and all rows having nonprime index of triangle T(p,k) defined in A034807 (coefficients of Lucas polynomials). Sequence gives resulting sub-triangle read by rows.at n=38A096539
- Expansion of (1 + 4*x + 4*x^2)/((1+x)*(1-x)^3).at n=45A102214
- Numbers n such that a^u + b^u + c^u + ... is prime, where a*b*c* ... is the prime factorization of n and u is the largest prime dividing n.at n=47A108405
- Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1), U=(1,2), or d=(1,-1) and have k triple descents (i.e., ddd's).at n=27A108443
- Numbers that have exactly five prime factors counted with multiplicity (A014614) whose digit reversal is different and also has 5 prime factors (with multiplicity).at n=35A109025