6931
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7200
- Proper Divisor Sum (Aliquot Sum)
- 269
- 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
- 6664
- Möbius Function
- 1
- Radical
- 6931
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = floor(10000*log(n)).at n=1A004243
- a(n) = 10000*log(n) rounded to nearest integer.at n=1A004244
- Pseudoprimes to base 24.at n=25A020152
- Pseudoprimes to base 38.at n=38A020166
- Pseudoprimes to base 100.at n=37A020228
- Strong pseudoprimes to base 24.at n=8A020250
- Strong pseudoprimes to base 38.at n=12A020264
- Numbers k such that the continued fraction for sqrt(k) has period 72.at n=23A020411
- a(n) = position of n^3 + (n+1)^3 + (n+2)^3 in A024975.at n=27A024980
- Number of 4-ary rooted trees with n nodes and height exactly 7.at n=14A036631
- Number of primes between n*100000 and (n+1)*100000.at n=17A038825
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 2.at n=43A050028
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 2.at n=43A050044
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 2.at n=43A050060
- 19-gonal (or enneadecagonal) numbers: n(17n-15)/2.at n=29A051871
- a(n) = floor(A*a(n-1) + B*a(n-2) + C)/p^r, where p^r is the highest power of p dividing floor(A*a(n-1) + B*a(n-2) + C), A=1.0001, B=1.0001, C=1, p=2.at n=29A053521
- a(n) = 4*n^2 - 3*n + 1.at n=42A054552
- a(n) = (n + 2)*(2*n^2 - n + 3)/6.at n=27A056520
- Composite numbers whose divisors (except 1) all contain the digit 9.at n=6A062680
- Smallest number that is centered polygonal in exactly n ways.at n=13A063773