3246
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 6504
- Proper Divisor Sum (Aliquot Sum)
- 3258
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 1080
- Möbius Function
- -1
- Radical
- 3246
- 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
- 136
- Smith Number
- yes
- 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
- Positive even numbers that are not the sum of a pair of twin primes.at n=30A007534
- Coordination sequence T4 for Zeolite Code GOO.at n=39A008114
- Coordination sequence T4 for Zeolite Code iRON.at n=40A009884
- Expansion of 1/(1-x^5-x^6-x^7-x^8-x^9-x^10-x^11-x^12-x^13-x^14).at n=37A017845
- Number of balls in pyramid with base either a regular hexagon or a hexagon with alternate sides differing by 1 (balls in hexagonal pyramid of height n taken from hexagonal close-packing).at n=23A019298
- Numbers k such that Fibonacci(k) == 8 (mod k).at n=28A023177
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Lucas numbers), t = A014306.at n=29A025097
- a(n) = T(n,0) + T(n,1) + ... + T(n,[ n/2 ]), T given by A026714.at n=10A026722
- 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 36.at n=28A031534
- a(n) = floor(E_(n+1)/E_(n)) where E_n is n-th Euler number (see A028296 and A000364).at n=43A034971
- Digit sum of 'even' number equals digit sum of 'sum' and 'juxtaposition' of its prime factors (counted with multiplicity).at n=34A036926
- Number of pairs {i,j}, i>1, j>1, such that ij < n^2.at n=33A037048
- Lexically first set of (even) numbers, beginning with 4, such that for any two different terms, a(i) + a(j) + 1 is prime.at n=6A037100
- Bisection of A028289.at n=33A038390
- Coordination sequence T2 for Zeolite Code STF.at n=38A038441
- Numbers n such that string 4,6 occurs in the base 10 representation of n but not of n-1.at n=35A044378
- Numbers n such that string 4,6 occurs in the base 10 representation of n but not of n+1.at n=35A044759
- Number of factorizations into distinct factors with 2 levels of parentheses indexed by prime signatures. A050347(A025487).at n=36A050348
- A simple grammar: rooted ordered set partitions.at n=6A052882
- Numbers k such that 80*R_k + 1 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=9A056664