6636
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
- 4
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 17920
- Proper Divisor Sum (Aliquot Sum)
- 11284
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1872
- Möbius Function
- 0
- Radical
- 3318
- Omega Function (Ω)
- 5
- 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
- 44
- 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
- yes
- Odd
- no
Appears in sequences
- Cycle class sequence c(2n) (the number of true cycles of length 2n in which a certain node is included) for zeolite SOD = Sodalite Na6[ Al6Si6O24 ] . 2 NaCl.at n=5A019060
- a(n) = n*(23*n + 1)/2.at n=24A022281
- Expansion of sinh(tan(x)*sinh(x))/2.at n=4A024276
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Lucas numbers), t = (F(2), F(3), ...).at n=13A024472
- Position of 2^n among the powers of primes (A000961).at n=16A024622
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Lucas numbers), t = (F(2), F(3), F(4), ...).at n=12A025092
- a(n) = Sum_{j=0..n} T(n, j), where T is given by A026552.at n=10A026564
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 54.at n=23A031552
- Numbers having three 6's in base 10.at n=15A043515
- a(n) = Sum_{h=0..n, k=0..n} T(h,k), array T counting knights' moves as in A049604.at n=25A047881
- a(n) = Sum_{k=1..n} lcm(n,k).at n=27A051193
- Local ranks of terms of A057122.at n=40A057124
- Numbers which contain exactly the same digits (with the correct multiplicity) in 3 different smaller bases.at n=11A059828
- Numbers k such that sigma(x) = k has exactly 6 solutions.at n=29A060662
- Number of 3 X n (0,1) matrices such that each row and each column is nondecreasing or nonincreasing.at n=13A086113
- Indices of primes of the form k^2 - 11.at n=33A091273
- Indices of primes in the sequence defined by A(0) = 47, A(n) = 10*A(n-1) - 33 for n > 0.at n=24A101724
- Least positive k such that k * [RSA-200]^n - 1 is prime, where RSA-200 is the 200 decimal digit RSA challenge number A391940(15).at n=28A108375
- First differences of A112069.at n=9A112139
- Number of permutations of length n which avoid the patterns 123, 51432.at n=9A116847