3234
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 8208
- Proper Divisor Sum (Aliquot Sum)
- 4974
- 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
- 840
- Möbius Function
- 0
- Radical
- 462
- 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
- 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
- a(n) = floor(n*(n+2)*(2*n-1)/8).at n=22A007518
- "Pascal sweep" for k=8: draw a horizontal line through the 1 at C(k,0) in Pascal's triangle; rotate this line and record the sum of the numbers on it (excluding the initial 1).at n=50A009522
- Coordination sequence T2 for Zeolite Code -WEN.at n=41A009863
- 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 = A000201 (lower Wythoff sequence).at n=16A024474
- a(n) = 49*(n-1)*(n-2)/2.at n=10A027469
- a(n) = (n+1)*binomial(n+5, 5).at n=6A027810
- a(n) = 42*(n+1) * binomial(n+5,10).at n=1A027815
- Expansion of 1/((1-3*x)*(1-4*x)*(1-5*x)*(1-9*x)).at n=3A028028
- Positions of record values in A030727.at n=49A030732
- Concatenation of n and n + 2 or {n,n+2}.at n=31A032607
- Numbers n such that string 3,4 occurs in the base 10 representation of n but not of n-1.at n=35A044366
- Numbers n such that string 3,4 occurs in the base 10 representation of n but not of n+1.at n=35A044747
- Sum of first n lucky numbers.at n=37A046279
- Pentagonal numbers multiplied by 2: a(n) = n*(3*n-1).at n=33A049450
- Duplicate of A027810.at n=6A051922
- a(n) = T(n,n-6), array T as in A055801.at n=22A055806
- Numbers k such that k^12 == 1 (mod 13^3).at n=17A056086
- Coefficient triangle of certain polynomials N(4; m,x).at n=34A062264
- Nearest integer to (Product(n^((1 + log(i))/i^2), {i, 1, n})).at n=29A062483
- Numbers k such that phi(sigma(k^3)) is a square.at n=39A063796