3490
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 6300
- Proper Divisor Sum (Aliquot Sum)
- 2810
- 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
- 1392
- Möbius Function
- -1
- Radical
- 3490
- 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
- 149
- Smith Number
- no
- 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
- Antichains (or order ideals) in the poset 2*2*4*n or size of the distributive lattice J(2*2*4*n).at n=2A006361
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite MOR = Mordenite Na8[Al8Si40O96].24H2O starting with a T4 atom.at n=11A019182
- Numbers k such that the continued fraction for sqrt(k) has period 17.at n=20A020356
- Numbers k such that Fibonacci(k) == 55 (mod k).at n=45A023181
- a(n+1) = a(n) converted to base 8 from base 7 (written in base 10).at n=32A023388
- a(n) = floor(Pi^n / e).at n=8A032637
- Coordination sequence T6 for Zeolite Code STT.at n=39A038421
- Position of the first occurrence of n in continued fraction for Champernowne constant (A030167).at n=49A038706
- Numbers n such that string 4,9 occurs in the base 10 representation of n but not of n-1.at n=38A044381
- Numbers n such that string 9,0 occurs in the base 10 representation of n but not of n-1.at n=37A044422
- Numbers k such that string 9,0 occurs in the base 10 representation of k but not of k+1.at n=37A044803
- Coordination sequence T3 for Zeolite Code MSO.at n=41A047965
- a(0) = 0; for n>0, a(n) = A005598(n)/2.at n=40A049703
- a(n)=a(n-1)+a(m), where m=2n-2-2^(p+1) and 2^p<n-1<=2^(p+1), for n >= 4.at n=26A050063
- Numbers k such that 171*2^k-1 is prime.at n=22A050837
- Antichains (or order ideals) in the poset 2*2*2*n or size of the distributive lattice J(2*2*2*n).at n=4A056932
- The binary encoding (as a rooted planar tree) of each rooted planar binary tree. See A057123 for illustration.at n=7A057122
- "Inverse permutation" to A064537. Limits of the recursion b(i+1)=B_[i](b(i)), where b(0)=n and B_[k](j) = B_[k-1](j) + k, k+1 <= j <= 2k; B_[k](j) = B_[k-1](j) - k, 2k+1 <= j <= 3k; B_[k](j) = B_[k-1](j) otherwise. Set a(n)=0 if b tends to infinity.at n=63A064791
- Values of k for which A065358(k) is 0.at n=27A064940
- A014486-encodings of the trees whose interior zigzag-tree (Stanley's c) is branch-reduced (in the sense defined by Donaghey).at n=44A080981