4340
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 10752
- Proper Divisor Sum (Aliquot Sum)
- 6412
- 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
- 1440
- Möbius Function
- 0
- Radical
- 2170
- 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
- 46
- 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
- Number of Hamiltonian cycles in D_4 X P_n.at n=7A003759
- Number of irreducible positions of size n in Montreal solitaire.at n=9A007048
- Coordination sequence T2 for Zeolite Code EAB and OFF.at n=48A008083
- Coordination sequence T2 for Zeolite Code SGT.at n=41A008230
- Coordination sequence for Cr3Si, Si position.at n=17A009927
- a(n) = n*(9*n + 1)/2.at n=31A022267
- Long leg of more than one primitive Pythagorean triangle.at n=37A024410
- (d(n)-r(n))/5, where d = A026046 and r is the periodic sequence with fundamental period (1,0,4,0,0).at n=36A026048
- Numbers with exactly five distinct base-8 digits.at n=33A031985
- Number of ways to partition n elements into pie slices each with an odd number of elements.at n=23A032189
- Number of cyclic compositions of n into parts >= 2.at n=23A032190
- Number of partitions of n such that cn(0,5) = cn(1,5) < cn(3,5) < cn(2,5) = cn(4,5).at n=69A036876
- Base 6 digits are, in order, the first n terms of the periodic sequence with initial period 3,2,0.at n=4A037669
- Integers k such that in the list of divisors of k (in base 5), each digit 0-4 appears equally often.at n=14A045869
- a(n+1) = a(n) converted to base 10 from base 11.at n=48A055982
- Numbers k such that sigma(x) = k has exactly 5 solutions.at n=38A060661
- a(n) = a(n-1) + a(n-1 minus the number of terms of the same parity as n so far).at n=45A060714
- Numbers n such that n and its reversal are both multiples of 14.at n=19A062904
- Non-palindromic number and its reversal are both multiples of 14.at n=11A062913
- "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=28A064791