3459
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
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4616
- Proper Divisor Sum (Aliquot Sum)
- 1157
- 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
- 2304
- Möbius Function
- 1
- Radical
- 3459
- Omega Function (Ω)
- 2
- 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
- 105
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = floor(1000*log_2(n)).at n=10A004265
- a(n) = round(1000*log_2(n)).at n=10A004266
- Integer part of Sum_{i=1..n} binomial(n,i) * (n/i)^i.at n=7A007806
- Coordination sequence T1 for Zeolite Code PAU.at n=43A008219
- Coordination sequence T2 for Coesite.at n=31A008268
- a(n) = floor(n*(n-1)*(n-2)/30).at n=48A011912
- Minimal number of people to give a 50% probability of having at least n coincident birthdays in one year.at n=19A014088
- a(n) = n*(n-1) + (n-2)*(n-3) + ... + 1*0 + 1 for n odd; otherwise, a(n) = n*(n-1) + (n-2)*(n-3) + ... + 2*1.at n=26A014112
- Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 16 (most significant digit on right).at n=23A029509
- 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 57.at n=20A031555
- "DIK" (bracelet, indistinct, unlabeled) transform of 1,3,5,7...at n=9A032288
- Numbers k such that 179*2^k+1 is prime.at n=19A032466
- Numerators of continued fraction convergents to sqrt(206).at n=4A041382
- Numbers n such that string 5,9 occurs in the base 10 representation of n but not of n-1.at n=37A044391
- Numbers n such that string 4,5 occurs in the base 10 representation of n but not of n+1.at n=38A044758
- Numbers n such that string 5,9 occurs in the base 10 representation of n but not of n+1.at n=37A044772
- Column 8 of triangle A055907.at n=4A055914
- Coordination sequence T3 for Zeolite Code MTF.at n=35A057306
- Numbers k such that k^2 + k + 1, k^3 + k + 1 and k^4 + k + 1 are all prime.at n=19A057683
- Composite and every divisor (except 1) contains the digit 3.at n=43A062668