6898
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 31
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10350
- Proper Divisor Sum (Aliquot Sum)
- 3452
- 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
- 3448
- Möbius Function
- 1
- Radical
- 6898
- Omega Function (Ω)
- 2
- 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
- 150
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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 bipartite partitions.at n=11A002765
- Number of distinct prime signatures of the positive integers up to 2^n.at n=44A025488
- Triangle T read by rows: differences of Motzkin triangle (A026300).at n=75A026105
- a(n) = Sum_{k=1..n} T(k, k-1), where T is the array in A026120.at n=9A026134
- a(n) = Sum_{ d|n } sigma(n/d)*d^4.at n=8A027848
- 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 82.at n=12A031580
- Sums of 6 distinct powers of 3.at n=30A038468
- Sum of remainders when n-th prime is divided by all preceding integers.at n=44A050482
- Numbers k such that k^16 == 1 (mod 17^3).at n=23A056088
- a(n) = 3^n + 4^n + 9^n.at n=4A074551
- a(n) = -1/16-3*n^2/8+17*n/12+n^3/12+(-1)^n/16.at n=44A088795
- a(1)=7; a(n)=floor((35+sum(a(1) to a(n-1)))/5).at n=38A120175
- Row sums of triangle A135858.at n=19A135859
- Binomial transform of [1, 2, 3, 4, 0, 0, 0, ...].at n=22A139488
- Triangle T(n,k), read by rows, given by (2, 1/2, 1/2, 0, 0, 0, 0, 0, 0, 0, ...) DELTA (2, -1/2, -1/2, 0, 0, 0, 0, 0, 0, 0, ...) where DELTA is the operator defined in A084938.at n=37A202396
- Number of words either empty or beginning with the first letter of the cyclic n-ary alphabet, where each letter of the alphabet occurs twice and letters of neighboring word positions are equal or neighbors in the alphabet.at n=13A208880
- Triangle of coefficients of polynomials v(n,x) jointly generated with A210751; see the Formula section.at n=43A210752
- T(n,k)=Square root of number of nXk arrays of occupancy after each element moves to some horizontal or vertical neighbor, with every occupancy equal to zero or two.at n=70A221314
- T(n,k)=Square root of number of nXk arrays of occupancy after each element moves to some horizontal or vertical neighbor, with every occupancy equal to zero or two.at n=73A221314
- a(n) = (n^4 - n^3 + 4*n^2 + 2)/2.at n=11A239592