6538
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11232
- Proper Divisor Sum (Aliquot Sum)
- 4694
- 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
- 2796
- Möbius Function
- -1
- Radical
- 6538
- 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
- 44
- 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
- a(1)=1, a(n) = 18*a(n-1) + n.at n=3A014901
- Numbers k such that the continued fraction for sqrt(k) has period 52.at n=39A020391
- a(n) = C(n+3,4) + 3*C(n+1,3) + 5*C(n-1,2) + 7*n - 15.at n=14A034858
- a(n) = C(n+3,4) + 3*C(n+1,3) + 5*C(n-1,2) + 7*n - 15 for n >= 3; a(1)=1, a(2)=10.at n=15A034859
- Number of partitions satisfying (cn(0,5) <= cn(2,5) = cn(3,5)).at n=43A036804
- Numbers m such that m^2 ends in 444.at n=26A039685
- Numbers whose base-4 representation contains exactly two 1's and four 2's.at n=35A045099
- Interprimes which are of the form s*prime, s=14.at n=12A075289
- a(1) = 668; for n > 1, a(n) = a(n-1) + 1 + sum of distinct prime factors of a(n-1) that are < a(n-1).at n=24A105212
- The following triangle is based on Pascal's triangle. The r-th term of the n-th row is sum of C(n,r) successive integers so that the sum of all the terms of the row is (2^n)*(2^n+1)/2, the 2^n -th triangular number. Sequence contains the triangle read by rows.at n=42A112358
- n times n+9 gives the concatenation of two numbers m and m+6.at n=4A116334
- a(0)=1; for n > 0, a(n) = a(n-1) + a(prime(n)(mod n)), where prime(n) is the n-th prime.at n=32A127066
- a(n) is the number of numbers removed in each step of Eratosthenes's sieve for 10!.at n=19A145537
- (L)-sieve transform of A004767 = {3,7,11,15,...,4n-1,...}.at n=27A155167
- Diagonal sums of triangle A155856.at n=7A155858
- Maximum coefficient of the polynomial (-1)^(n+1)*Product_{k=1..n} (1 - x^k)^2.at n=23A156082
- The number of times a point sum n is attained in all 7^6 permutations of throwing 7 dice.at n=10A166322
- The number of times a point sum n is attained in all 7^6 permutations of throwing 7 dice.at n=25A166322
- Rectified heptapeton (6-simplex) numbers: the coefficient of x^(2n-2) in (1+x+x^2+...+x^(n-1))^7.at n=6A179097
- Numbers n such that the sum of the numbers in the Collatz (3x+1) iteration of n is a perfect square.at n=24A225866