6838
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11088
- Proper Divisor Sum (Aliquot Sum)
- 4250
- 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
- 3144
- Möbius Function
- -1
- Radical
- 6838
- 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
- 150
- 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) is the sum of squares of the first n positive integers congruent to 2 mod 3.at n=12A024394
- a(n) = least m such that if r and s in {1/1, 1/3, 1/5, ..., 1/(2n-1)} satisfy r < s, then r < k/m < (k+4)/m < s for some integer k.at n=27A024847
- Numbers k such that 19*2^k+1 is prime.at n=8A032359
- Number of partitions in parts not of the form 21k, 21k+1 or 21k-1. Also number of partitions with no part of size 1 and differences between parts at distance 9 are greater than 1.at n=40A035979
- Number of configurations of the 5 X 2 variant of Sam Loyd's sliding block 15-puzzle that require a minimum of n moves to be reached, starting with the empty square in one of the corners.at n=20A090036
- Number of partitions of n such that the least part occurs with odd multiplicity.at n=33A096375
- a(n) = Fibonacci(n-1) + prime(n).at n=20A113753
- Sums of three consecutive hexagonal numbers.at n=33A129109
- Exponent of least power of 2 having exactly n consecutive 5's in its decimal representation.at n=7A131539
- Partial sums of floor(n^2/3) (A000212).at n=39A181286
- Numbers k such that A057775(k) is the factor of a Fermat number 2^(2^m) + 1 for some m.at n=37A201364
- Least k such that (2*n-1)*2^k + 1 is a prime factor of a Fermat number 2^(2^m) + 1 for some m, or 0 if no such value exists.at n=9A215540
- Floor(M(g(n-1)+1,..,g(n))), where M = harmonic mean and g(n) = n(n + 1)(n + 2)/6.at n=33A227016
- Sum of positive ranks of all overpartitions of n.at n=17A236001
- Maximum starting value of X such that repeated replacement of X with X-ceiling(X/8) requires n steps to reach 0.at n=55A279078
- Number of n X 7 0..1 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=5A281204
- Number of 6 X n 0..1 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=6A281210
- Number of nX5 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1, 2 or 3 neighboring 1s.at n=2A297651
- T(n,k)=Number of nXk 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1, 2 or 3 neighboring 1s.at n=23A297654
- Number of 3Xn 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1, 2 or 3 neighboring 1s.at n=4A297656