4935
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
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 9216
- Proper Divisor Sum (Aliquot Sum)
- 4281
- 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
- 2208
- Möbius Function
- 1
- Radical
- 4935
- Omega Function (Ω)
- 4
- 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
- no
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 196
- 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
- no
- Odd
- yes
Appears in sequences
- Number of partitions of n into at most 6 parts.at n=43A001402
- a(n) = n*(4*n+1).at n=35A007742
- Coordination sequence T2 for Zeolite Code CAS.at n=42A008064
- Expansion of (1-x^5) / (1-x)^5.at n=18A008487
- Fibonacci sequence beginning 0, 5.at n=16A022088
- a(n) = n*(11*n - 1)/2.at n=30A022268
- Number of partitions of n in which the greatest part is 6.at n=49A026812
- Squarefree odd numbers with exactly 4 distinct prime factors.at n=23A046390
- Larger members of g-reduced amicable pairs a < b such that sigma(a) = sigma(b) = a + b + gcd(a,b).at n=19A054572
- Layer counting sequence for hyperbolic tessellation by regular pentagons of angle Pi/2.at n=8A054888
- T(n,n-5), where T is the array in A055830.at n=13A055832
- McKay-Thompson series of class 20B for Monster.at n=18A058551
- Triangle T(n,m) of numbers of m-block T_0-covers of a labeled n-set, m = 0..2^n - 1.at n=21A059202
- Number of 5-gonal compositions of n into positive parts.at n=22A069983
- Triangle T(n,k) = f(n,k,n-2), n >= 2, 1 <= k <= n-1, where f is given below.at n=41A075780
- Triangle T(n,k) = f(n,k,n-2), n >= 2, 1 <= k <= n-1, where f is given below.at n=39A075780
- Triangle T(n,k) = f(n,k,n-2), n >= 0, 0 <= k <= n, where f is given below.at n=59A075837
- Triangle T(n,k) = f(n,k,n-2), n >= 0, 0 <= k <= n, where f is given below.at n=61A075837
- 2-apexes of omega: numbers k such that omega(k-2) < omega(k-1) < omega(k) > omega(k+1) > omega(k+2), where omega(m) = the number of distinct prime factors of m.at n=24A076762
- 2-nadirs of phi: numbers k such that phi(k-2) > phi(k-1) > phi(k) < phi(k+1) < phi(k+2).at n=23A076773