3236
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 5670
- Proper Divisor Sum (Aliquot Sum)
- 2434
- 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
- 1616
- Möbius Function
- 0
- Radical
- 1618
- Omega Function (Ω)
- 3
- 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
- 48
- 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
- Numbers that are the sum of 9 positive 6th powers.at n=39A003365
- Positions of remoteness 4 in Beans-Don't-Talk.at n=21A005696
- Coordination sequence T1 for Zeolite Code AEI.at n=43A008001
- Coordination sequence T2 for Zeolite Code ATS.at n=41A008039
- Coordination sequence T7 for Zeolite Code MTW.at n=37A008202
- If a, b in sequence, so is ab+5.at n=39A009304
- Numbers n such that phi(n) * sigma(n) + 9 is a perfect square.at n=36A015728
- Number of words of length n (n >= 1) over a two-letter alphabet having a minimal period of size n-2.at n=13A019311
- Numbers k such that the continued fraction for sqrt(k) has period 50.at n=12A020389
- Number of n-move self-avoiding knight paths on 5 X 5 board, beginning at corner.at n=23A025589
- a(n) = 3*n^2 - 7*n + 6.at n=34A027599
- 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 28.at n=35A031526
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 24 ones.at n=32A031792
- Concatenation of n and n + 4 or {n,n+4}.at n=31A032609
- Number of partitions satisfying cn(1,5) <= cn(0,5) + cn(2,5) and cn(1,5) <= cn(0,5) + cn(3,5) and cn(4,5) <= cn(0,5) + cn(2,5) and cn(4,5) <= cn(0,5) + cn(3,5).at n=33A039874
- Numbers k such that the string 8,5 occurs in the base 9 representation of k but not of k-1.at n=43A044328
- Numbers n such that string 3,6 occurs in the base 10 representation of n but not of n-1.at n=35A044368
- Numbers n such that string 8,5 occurs in the base 9 representation of n but not of n+1.at n=43A044709
- Numbers n such that string 3,6 occurs in the base 10 representation of n but not of n+1.at n=35A044749
- a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049735.at n=11A049736