2298
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 4608
- Proper Divisor Sum (Aliquot Sum)
- 2310
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 764
- Möbius Function
- -1
- Radical
- 2298
- 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
- 45
- 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
- Number of permutations of {1,...,n} having n-4 inversions (n>=4).at n=6A001894
- Number of "cubic partitions" of n: expansion of Product_{k>0} 1/((1-x^(2k))^2*(1-x^(2k-1))) in powers of x.at n=19A002513
- Consider a 2-D cellular automaton generated by the Schrandt-Ulam rule of A170896, but confined to a semi-infinite strip of width n, starting with one ON cell at the top left corner; a(n) is the period of the resulting structure.at n=45A006447
- a(n) = floor(n(n-1)(n-2)(n-3)/19).at n=16A011929
- Number of trees on n nodes with forbidden limbs.at n=15A014281
- Numbers k such that Fibonacci(k) == -8 (mod k).at n=28A023166
- a(n) = n-th largest even number in array T given by A027170.at n=38A027183
- a(n) = (n+3)^2 - 6.at n=45A028878
- Numbers whose set of base-9 digits is {1,3}.at n=25A032916
- Coordination sequence T5 for Zeolite Code STF.at n=32A038440
- Sums of 4 distinct powers of 3.at n=43A038466
- Denominators of continued fraction convergents to sqrt(511).at n=8A041977
- Numbers having three 3's in base 9.at n=4A043467
- Numbers k such that string 7,2 occurs in the base 8 representation of k but not of k-1.at n=39A044245
- Numbers n such that string 3,3 occurs in the base 9 representation of n but not of n-1.at n=28A044281
- Numbers n such that string 9,8 occurs in the base 10 representation of n but not of n-1.at n=24A044430
- Numbers n such that string 7,2 occurs in the base 8 representation of n but not of n+1.at n=39A044626
- Numbers n such that string 3,3 occurs in the base 9 representation of n but not of n+1.at n=28A044662
- Numbers n such that string 9,8 occurs in the base 10 representation of n but not of n+1.at n=24A044811
- Numbers whose base-3 representation contains exactly four 0's and four 1's.at n=8A044989