6629
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7584
- Proper Divisor Sum (Aliquot Sum)
- 955
- 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
- 5676
- Möbius Function
- 1
- Radical
- 6629
- Omega Function (Ω)
- 2
- 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
- 75
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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 points on surface of square pyramid: 3*n^2 + 2 (n>0).at n=47A005918
- Expansion of 1/((1-x)(1-2x)(1-10x)(1-12x)).at n=3A021324
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (composite numbers), t = (odd natural numbers).at n=25A025104
- Numbers k such that if d,e are consecutive digits of k in base 6, then |d-e| >= 4.at n=38A032988
- Base-6 palindromes that start with 5.at n=18A043014
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 18.at n=35A050967
- Triangle of coefficients of polynomials P(n; x) = Permanent(M), where M=[m(i,j)] is n X n matrix defined by m(i,j)=x if 0<=i-j<=2 else m(i,j)=1.at n=40A080061
- Composite numbers k such that k+d+1 is prime for all divisors d of k greater than 1.at n=44A120776
- Positive integers whose sixth power is the sum of seven sixth powers (smallest primitive solutions).at n=37A132410
- Expansion of x^3*(x-1)^2*(x+1) / (x^6-3*x^5+3*x^4-x+1).at n=37A135991
- Numbers n such that primorial(n)/2 - 32 is prime.at n=20A139446
- Row sums of triangle A178239.at n=28A178240
- Total number of parts that are not the smallest part in all partitions of n.at n=24A182984
- Number of ordered triples (w,x,y) with all terms in {1,...,n} and w^3 < x^3 + y^3.at n=21A211650
- a(n) is the least value of k such that the decimal expansion of n^k contains eight or more consecutive identical digits.at n=34A217163
- a(n) = n*(9*n + 25)/2 + 6.at n=37A235332
- Number of partitions p of n such that (number of numbers in p that have multiplicity 1) = (number of numbers in p having multiplicity > 1).at n=40A241274
- a(n) are values of k that yield "record-breaking" integer sequence lengths for the recursion: b(i) = 3*(b(i-1) + b(i-2))/2, with b(0) = 1 and b(1) = k.at n=7A249861
- Number of set partitions of [n] such that the difference between each element and its block index is a multiple of nine.at n=28A274842
- Positions of ones in A264977; positions of twos in A277330.at n=47A277701