2476
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
- 4
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 4340
- Proper Divisor Sum (Aliquot Sum)
- 1864
- 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
- 1236
- Möbius Function
- 0
- Radical
- 1238
- Omega Function (Ω)
- 3
- 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
- 133
- 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
- A nonlinear binomial sum.at n=13A000128
- a(0) = 1, a(1) = 4; thereafter a(n)*(2n + 10) - a(n-1)*(11n + 35) + a(n-2)*(8n + 2) + a(n-3)*(15n + 7) + a(n-4)*(4n - 2) = 0.at n=6A001559
- a(n) = a(n-2) + a(n-3), with a(0) = 0, a(1) = 1, a(2) = 4.at n=27A007309
- Coordination sequence T2 for Zeolite Code LOV.at n=33A008135
- Coordination sequence T3 for Zeolite Code VSV.at n=32A009916
- Theta series of lattice Kappa_7.at n=8A015236
- Numbers k such that the continued fraction for sqrt(k) has period 72.at n=0A020411
- Numbers k such that Fibonacci(k) == 3 (mod k).at n=30A023175
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = (1, p(1), p(2), ...).at n=45A024369
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = (primes).at n=44A024377
- Duplicate of A024377.at n=44A025069
- Number of partitions of n into distinct parts >= 4.at n=63A025149
- Number of partitions of n into distinct parts, the least being 3.at n=66A026824
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 24.at n=33A031522
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 28 ones.at n=8A031796
- Shifts left 2 places under "BIJ" (reversible, indistinct, labeled) transform.at n=7A032118
- Number of partitions of n such that cn(3,5) <= cn(0,5) = cn(1,5) <= cn(2,5) = cn(4,5).at n=62A036865
- Even numbers k such that b(k) is greater than b(k-1) and b(k+1); b(k) = A033178(k).at n=39A038007
- Coordination sequence T14 for Zeolite Code STT.at n=33A038430
- Numerators of continued fraction convergents to sqrt(516).at n=6A041986