3466
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5202
- Proper Divisor Sum (Aliquot Sum)
- 1736
- 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
- 1732
- Möbius Function
- 1
- Radical
- 3466
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 30
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = 1000*log(n) rounded to the nearest integer.at n=31A004241
- a(n) = ceiling(1000*log(n)).at n=31A004242
- Coordination sequence T4 for Zeolite Code STI.at n=40A008237
- Coordination sequence T3 for Zeolite Code -CHI.at n=37A009848
- Coordination sequence T2 for Zeolite Code iRON.at n=41A009882
- Numbers k such that the continued fraction for sqrt(k) has period 53.at n=4A020392
- a(n)-th nonsquarefree is sum of first k nonsquarefrees for some k.at n=37A020644
- Expansion of 1/((1-x)(1-4x)(1-7x)(1-9x)).at n=3A021864
- a(n) = Sum_{k=0..floor(n/2)} A026637(n-k, k).at n=17A026647
- Numbers k such that 247*2^k+1 is prime.at n=19A032500
- Numbers n such that string 6,6 occurs in the base 10 representation of n but not of n-1.at n=34A044398
- Numbers n such that string 6,6 occurs in the base 10 representation of n but not of n+1.at n=34A044779
- Sums of two squares of Fibonacci numbers.at n=52A045702
- Central column of arrays in A057027 and A057028.at n=41A057029
- Coordination sequence for ReO_3 net with respect to oxygen atom O_1.at n=34A066394
- Centered 15-gonal numbers: a(n) = (15*n^2 - 15*n + 2)/2.at n=21A069128
- Numbers of form 2^i*3^j + (i+j) with i, j >= 0.at n=52A069357
- Define C(n) by the recursion C(0) = 1 + I where I^2 = -1, C(n+1) = 1/(1+C(n)); then a(n) = (-1)^n/Im(C(n)) where Im(z) is the imaginary part of the complex number z.at n=8A069921
- Numbers k such that phi(k-1) < phi(k) < phi(k+1), where phi is the Euler totient function (A000010).at n=27A078776
- a(n) = 15*n^2 + 6*n + 1.at n=15A080861