4925
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 6138
- Proper Divisor Sum (Aliquot Sum)
- 1213
- 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
- 3920
- Möbius Function
- 0
- Radical
- 985
- Omega Function (Ω)
- 3
- 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
- 72
- 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
- no
- Odd
- yes
Appears in sequences
- Coordination sequence T3 for Zeolite Code VNI.at n=43A009909
- Numbers k such that the continued fraction for sqrt(k) has period 7.at n=34A010338
- a(n) = Sum_{k=0..n} (k+1)*T(n, n-k), where T is given by A008288.at n=8A026937
- Numbers k such that 203*2^k + 1 is prime.at n=14A032478
- Number of partitions of n such that cn(0,5) = cn(2,5) <= cn(3,5) = cn(4,5) < cn(1,5).at n=54A036847
- Number of ways of numbering the vertices of a cube so sum of the 8 numbers is n.at n=14A039959
- a(n) = (3^(n+1) + 2*n + 1)/4.at n=8A047926
- Numbers k such that k and k-1 both have 6 divisors.at n=49A049104
- a(n)=T(n,n), array T as in A049735.at n=28A049740
- a(n) = (s(n)-(n mod 2)) / n where s(n) is A006533.at n=50A056891
- Numbers k such that !k + phi(k) - 1 is prime.at n=8A063685
- Ado [Simone Caramel]'s function: a(0) = 1, a(n) = a(n-1) + 2*(Fibonacci(n+1)-n), n > 0.at n=15A064551
- Triangle where T(n,k)=2*T(n,k-1)+C(n-1,k)-C(n-1,k-1) and n>=k>=0.at n=63A067337
- a(n) = n*(2*n^2 -3*n +7)/6 = C(n, 1) + C(n, 2) + 2*C(n, 3).at n=24A081489
- Smallest integral ladder whose ends slide over the respective distances 1 and m=2*n+1 while slipping down along horizontal ground and vertical wall against which it leans.at n=3A094081
- Array, A(n, k) = ((n+2)^(k+1) + (k+1)*n*(n+1) - 1)/(n+1)^2, read by antidiagonals.at n=53A094250
- Increasingly larger values in A110412.at n=12A111632
- a(n) = dimension of the space in which the sphere of radius n is of maximum volume.at n=27A121546
- Numbers k such that k and k^2 use only the digits 2, 4, 5, 6 and 9.at n=8A137096
- a(n) = n*(8*n - 3).at n=25A139273