4630
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 8352
- Proper Divisor Sum (Aliquot Sum)
- 3722
- 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
- 1848
- Möbius Function
- -1
- Radical
- 4630
- 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
- 108
- 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
- Numbers that are the sum of 4 positive 7th powers.at n=11A003371
- Numbers that are the sum of at most 4 positive 7th powers.at n=30A004866
- Numbers that are the sum of at most 5 positive 7th powers.at n=43A004867
- Total number of parts in all partitions of n. Also, sum of largest parts of all partitions of n.at n=20A006128
- Coordination sequence T4 for Zeolite Code AET.at n=47A008010
- Coordination sequence T3 for Zeolite Code MFS.at n=42A008175
- Coordination sequence for MgNi2, Position Mg2.at n=17A009935
- Pseudoprimes to base 21.at n=15A020149
- a(n) = T(n,m) + T(n,m+1) + ... + T(n,n), m=[ (n+1)/2 ], T given by A026769.at n=12A026891
- a(n) = floor((n^3)/2).at n=21A036487
- Number of partitions of n such that cn(0,5) = cn(1,5) <= cn(3,5) <= cn(2,5) = cn(4,5).at n=67A036864
- Differences of A038011.at n=23A038012
- Coordination sequence T8 for Zeolite Code STT.at n=45A038418
- Coordination sequence T14 for Zeolite Code STT.at n=45A038430
- Integers n >= 1 such that n divides 0!-1!+2!-3!+4!-...+(-1)^{n-1}(n-1)!.at n=26A064383
- Numbers in A064383 that are squarefree.at n=18A064392
- Numbers k such that the sum of digits of k^k is a square.at n=40A066236
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=5, I={0,1,4}.at n=37A079956
- Values of n corresponding to the terms in sequence A080155. For any k, the concatenation of the a(1) to a(k)-th primes is prime and each value of k is the smallest for which this is true.at n=42A080156
- Triangle T(n,k), 0<=k<=n, read by rows defined by: T(n,k) = T(n-1,k-1) + 2*T(n-1,k) + T(n-2,k-2) - T(n-2,k), T(0,0) = 1, T(n,k) = 0 if k < 0 or if n < k.at n=49A102756