4682
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7026
- Proper Divisor Sum (Aliquot Sum)
- 2344
- 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
- 2340
- Möbius Function
- 1
- Radical
- 4682
- 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
- 59
- 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) is the number of partitions of 2n that can be obtained by adding together two (not necessarily distinct) partitions of n.at n=14A002219
- Total preorders.at n=4A006329
- Number of unsensed loopless planar maps with n edges.at n=8A006391
- Moebius transform of numbers of preferential arrangements.at n=7A006936
- Coordination sequence T5 for Zeolite Code NON.at n=41A008216
- Coordination sequence T2 for Zeolite Code RUT.at n=45A009898
- Coordination sequence for CaF2(1), F position.at n=23A009924
- Numbers k such that the continued fraction for sqrt(k) has period 11.at n=42A020350
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = (primes).at n=23A024867
- Number of partitions of n into distinct parts, the least being odd.at n=56A026832
- a(n) = A027113(n, 2n).at n=10A027118
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted then there are a pair of central terms both equal to 4.at n=37A031417
- Numbers whose set of base-8 digits is {1,2}.at n=31A032929
- Positive numbers having the same set of digits in base 5 and base 8.at n=29A037431
- Numbers whose maximal base-8 run length is 4.at n=9A037995
- Numbers having four 2's in base 5.at n=27A043360
- Numbers having four 1's in base 8.at n=5A043428
- Number of cubic residues mod 2^n.at n=13A046630
- Array A read by diagonals; n-th difference of (A(k,n), A(k,n-1),..., A(k,0)) is (k+2)^(n-1), for n=1,2,3,...; k=0,1,2,...at n=60A047848
- a(n) = A047848(5, n).at n=5A047853