2414
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
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 3888
- Proper Divisor Sum (Aliquot Sum)
- 1474
- 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
- 1120
- Möbius Function
- -1
- Radical
- 2414
- 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
- 71
- 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
- Numbers that are the sum of 3 nonnegative cubes in more than 1 way.at n=24A001239
- Number of symmetric plane partitions of n.at n=28A005987
- From a problem in AI planning: a(n) = 4+a(n-1)+a(n-2)+a(n-3)+a(n-4)-a(n-5)-a(n-6)-a(n-7), n>7.at n=12A007800
- Coordination sequence T1 for Zeolite Code APC.at n=34A008032
- Coordination sequence T3 for Zeolite Code LIO.at n=34A008131
- Coordination sequence T1 for Zeolite Code MTT.at n=30A008189
- Numbers that are the sum of 3 positive cubes in more than one way.at n=16A008917
- a(n) = n*(2*n + 3).at n=34A014106
- Powers of fifth root of 20 rounded to nearest integer.at n=13A018172
- Powers of fifth root of 20 rounded up.at n=13A018173
- Numbers k such that the continued fraction for sqrt(k) has period 24.at n=42A020363
- Numbers that are the sum of 3 positive cubes in exactly 2 ways.at n=16A025396
- a(n) = sum of the numbers between the two n's in A026366.at n=25A026369
- Triangular array T read by rows (9-diamondization of Pascal's triangle). Step 1: t(n,k) = sum of 9 entries in diamond-shaped subarray of Pascal's triangle having vertices C(n,k), C(n+4,k+2), C(n+2,k), C(n+2,k+2). Step 2: T(n,k) = t(n,k) - t(0,0) + 1.at n=41A026907
- Triangular array T read by rows (9-diamondization of Pascal's triangle). Step 1: t(n,k) = sum of 9 entries in diamond-shaped subarray of Pascal's triangle having vertices C(n,k), C(n+4,k+2), C(n+2,k), C(n+2,k+2). Step 2: T(n,k) = t(n,k) - t(0,0) + 1.at n=39A026907
- a(n) = A026907(2*n, n-1).at n=3A026910
- Numbers k such that k^2 is palindromic in base 11.at n=21A029996
- 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 48.at n=10A031546
- a(n) = 2*n*(4*n + 3).at n=17A033587
- Numbers for which the sum of reciprocals of digits is an integer.at n=40A034708