4840
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
- 24
- Divisor Sum
- 11970
- Proper Divisor Sum (Aliquot Sum)
- 7130
- 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
- 1760
- Möbius Function
- 0
- Radical
- 110
- Omega Function (Ω)
- 6
- 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
- 20
- 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 compositions of n into 4 ordered relatively prime parts.at n=29A000742
- Expansion of 1/((1+x)*(1-x)^5).at n=19A001752
- Specific heat coefficients for square lattice spin 2 Ising model.at n=14A010112
- a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t(n)=2*n+1 (odd numbers).at n=29A023865
- Theta series of A*_10 lattice.at n=23A023922
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = natural numbers, t = odd natural numbers.at n=28A024862
- a(1) = 7; a(n+1) = a(n)-th composite.at n=26A025011
- Numbers k that divide the (right) concatenation of all numbers <= k written in base 11 (most significant digit on left).at n=28A029456
- a(n) = floor(5*n^2/2).at n=44A032526
- a(n) = 10*n^2.at n=22A033583
- Number of 2n-bead balanced binary strings, rotationally equivalent to reverse, inequivalent to complement and reversed complement.at n=11A045658
- Number of 2n-bead balanced binary strings of fundamental period 2n, rotationally equivalent to reverse, inequivalent to complement and reversed complement.at n=11A045667
- Numbers whose consecutive digits differ by 4.at n=41A048406
- Twice second pentagonal numbers.at n=40A049451
- a(n)=T(n,n), array T as in A049723.at n=39A049728
- a(n) = Sum_{k=1..floor((n+1)/2)} T(n,2k-1), array T as in A049777.at n=29A049778
- Let Do(n)=A006566(n)=n-th dodecahedral number. Consider all integer triples (i,j,k), j >= k>0, with Do(i)=Do(j)+Do(k), ordered by increasing i; sequence gives j values.at n=3A053018
- a(n) = n^2 * phi(n).at n=21A053191
- Number of bracketings of 0^0^0^...^0, with n 0's, giving the result 0, with conventions that 0^0 = 1^0 = 1^1 = 1, 0^1 = 0.at n=11A055113
- a(n) = T(n,n-4), array T as in A055807.at n=26A055809