2438
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 3888
- Proper Divisor Sum (Aliquot Sum)
- 1450
- 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
- 1144
- Möbius Function
- -1
- Radical
- 2438
- 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
- 133
- 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
- a(n) = (9*n+1)*(9*n+8).at n=5A001534
- Number of restricted 3 X 3 matrices with row and column sums n.at n=30A005045
- a(n) = C_n / 2 if n is even or ( C_n + C_((n-1)/2) ) / 2 if n is odd, where C = Catalan numbers (A000108).at n=8A007595
- Number of partitions of n into parts >= 3.at n=42A008483
- If a, b in sequence, so is ab+10.at n=17A009368
- Coordination sequence for FeS2-Pyrite, Fe position.at n=24A009957
- Number of ZnS polytypes that repeat after n layers.at n=17A011957
- Numbers n such that phi(n) * sigma(n) + 9 is a perfect square.at n=29A015728
- The sequence m(n) in A022905.at n=31A022907
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = A014306.at n=29A024596
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = A014306.at n=28A025110
- Index of 8^n within the sequence of the numbers of the form 3^i*8^j (A025615).at n=50A025728
- Number of partitions of n in which the least part is 3.at n=45A026796
- Self-convolution of array T given by A026386.at n=6A026951
- Sequence satisfies T^2(a)=a, where T is defined below.at n=41A027594
- a(n) = n*(n+7).at n=46A028563
- Positions of record values in A030737.at n=44A030742
- Number of necklaces with 8 black beads and n-8 white beads.at n=10A032193
- Number of necklaces with 10 black beads and n-10 white beads.at n=8A032195
- Number of ways to partition n elements into pie slices of different odd sizes allowing the pie to be turned over.at n=56A032229